The Turán number of the Fano plane

DOI10.1007/S00493-005-0034-2MaRDI QIDQ2368588zbMATH OpenOpenAlexFDO

Authors Peter Keevash, Benny Sudakov

Publication date 27 June 2006

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-005-0034-2

zbMATH Keywords

extremal setshypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Review text

It is proved that for \(n\geq n_0\), the maximal number of edges in a 3-uniform hypergraph on \(n\) vertices not containing a Fano plane is \(\binom{n}{3} - \binom{\lfloor n/2\rfloor}{3}-\binom{\lceil n/2\rceil}{3}\). This settles an old conjecture of Vera T.~Sós. To show the result, the authors prove that for every \(\varepsilon>0\) there is a \(\delta>0\) such that if \(H\) is a 3-uniform hypergraph on \(n\) vertices with \((\frac{3}{4}-\delta)\binom{n}{3}\) edges, with no Fano plane then there is a partition \((A,B)\) of the vertex set with \(e(A)+e(B)<\varepsilon n^3\).

Recommendations

• Turán's theorem for the Fano plane
• Generalized planar Turán numbers
• The Turán number of \(F_{3,3}\)
• scientific article; zbMATH DE number 1843855
• Turán numbers of extensions
• The Turán number of \(k \cdot S_\ell \)
• The number of pan-fan maps on the projective plane
• Planar Turán numbers of cycles: a counterexample
• On some numerical properties of Fano varieties
• Fano subplanes in finite Figueroa planes

Cited in

(62)

• Unit distances and diameters in Euclidean spaces
• Two-regular subgraphs of hypergraphs
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• Stability theorems for cancellative hypergraphs
• A hypergraph Turán problem with no stability
• A unified approach to hypergraph stability
• Extremal problems in uniformly dense hypergraphs
• Analytic methods for uniform hypergraphs
• Turán's theorem for the Fano plane
• The Ramsey number of Fano plane versus tight path
• An intersection theorem for four sets
• Codegree problems for projective geometries
• On the co-degree threshold for the Fano plane
• The Turán problem for projective geometries
• The co-degree density of the Fano plane
• A hypergraph extension of Turán's theorem
• New lower bounds for the Turán density of PG_m(q)
• Stability theorems for some Kruskal-Katona type results
• The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
• The exact Turán number of F(3,3) and all extremal configurations
• An expected polynomial time algorithm for coloring 2-colorable 3-graphs
• The Turán number of \(F_{3,3}\)
• The codegree threshold for 3-graphs with independent neighborhoods
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Structure and stability of triangle-free set systems
• Combinatorial theorems in sparse random sets
• On colourings of hypergraphs without monochromatic Fano planes
• Simplex stability
• On the independence numbers of the cubes of odd cycles
• Hypergraphs with many Kneser colorings
• Almost all triangle-free triple systems are tripartite
• Almost all hypergraphs without Fano planes are bipartite
• Turán problems on non-uniform hypergraphs
• Counting substructures. II: Hypergraphs
• An unstable hypergraph problem with a unique optimal solution
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• Rainbow Erdös-Rothschild problem for the Fano plane
• The extremal number of surfaces
• Independent sets in hypergraphs
• Set systems without a simplex or a cluster
• On the Chromatic Thresholds of Hypergraphs
• Stability results for random discrete structures
• A note on a Turán-type extremal question on 3-graphs
• On Triple Systems with Independent Neighbourhoods
• Hypergraph Turán densities can have arbitrarily large algebraic degree
• Spectral extremal graphs for the bowtie
• A 2-stable family of triple systems
• Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• Generating non-jumps from a known one
• The Turán number of surfaces
• Spectral Turán problems for nondegenerate hypergraphs
• Spectral Turán problems on the expansion of matchings
• Tight bounds for rainbow partial F-tiling in edge-colored complete hypergraphs
• Positive codegree Andrásfai-Erdős-Sós theorem for the generalized triangle
• Hypergraphs with many extremal configurations
• A criterion for Andrásfai-Erdős-Sós type theorems and applications
• Avoiding range via Turán-type bounds
• Pairwise intersections and forbidden configurations
• A new generalization of Mantel's theorem to \(k\)-graphs
• Constructions of non-principal families in extremal hypergraph theory
• An exact Turán result for the generalized triangle

This page was built for publication: The Turán number of the Fano plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368588)