Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-24T08:52:06.781Z Has data issue: false hasContentIssue false
  • English
  • Français

Triple Systems Not Containing a Fano Configuration

Published online by Cambridge University Press:  21 July 2005

ZOLTÁN FÜREDI  and
MIKLÓS SIMONOVITS
ZOLTÁN FÜREDI
Affiliation:
Rényi Institute of Mathematics of the Hungarian Academy of Sciences Budapest, PO Box 127, Hungary-1364 and Department of Mathematics, University of Illinois at Urbana-Champaign Urbana, IL61801, USA (e-mail: furedi@renyi.hu, z-furedi@math.uiuc.edu)
MIKLÓS SIMONOVITS
Affiliation:
Rényi Institute of Mathematics of the Hungarian Academy of Sciences Budapest, PO Box 127, Hungary-1364 (e-mail: miki@renyi.hu)
Get access Rights & Permissions [Opens in a new window]

Abstract

A Fano configuration is the hypergraph of 7 vertices and 7 triplets defined by the points and lines of the finite projective plane of order 2. Proving a conjecture of T. Sós, the largest triple system on $n$ vertices containing no Fano configuration is determined (for $n> n_1$). It is 2-chromatic with $\binom{n}{3}-\binom{\lfloor n/2 \rfloor}{3} -\binom{\lceil n/2 \rceil}{3}$ triples. This is one of the very few nontrivial exact results for hypergraph extremal problems.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 14 , Issue 4 , July 2005 , pp. 467 - 484
Copyright
© 2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)