The Turán Number Of The Fano Plane

@article{Keevash2005TheTN,
  title={The Tur{\'a}n Number Of The Fano Plane},
  author={Peter Keevash and Benny Sudakov},
  journal={Combinatorica},
  year={2005},
  volume={25},
  pages={561-574}
}
Moreover, the only extremal configuration can be obtained by partitioning an n-element set into two almost equal parts, and taking all the triples that intersect both of them. This extends an earlier result of de Caen and Füredi, and proves an old conjecture of V. Sós. In addition, we also prove a stability result for the Fano plane, which says that a 3-uniform hypergraph with density close to 3/4 and no Fano plane is approximately 2-colorable. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 39 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

A method for solving extremal problems in graph theory, stability problems; in: Theory of Graphs

M. Simonovits
(Proc. Colloq. Tihany, • 1966
View 4 Excerpts
Highly Influenced

Turán type problems, in: Surveys in combinatorics

Z. Füredi
London Math. Soc. Lecture Note Ser • 1991
View 10 Excerpts
Highly Influenced

A New Generaltzation of the Erdős-ko-rado Theorem

Peter Frankl, Z}lti N Füredi
1983
View 10 Excerpts
Highly Influenced

Extension of a theorem of Moon and Moser on complete subgraphs

D. De Caen
Ars Combinatoria • 1983
View 7 Excerpts
Highly Influenced

Mubayi : Stability theorems for cancellative hypergraphs

D.
J . Combinatorial Theory B • 2004

Stability theorems for cancellative hypergraphs

J. Comb. Theory, Ser. B • 2004
View 1 Excerpt

Kündgen: Turán problems for weighted graphs

A. Z. Füredi
J. Graph Theory • 2002
View 2 Excerpts

Simonovits : A method for solving extremal problems in graph theory , stability problems

M.
What we know and what we do not know about Turán numbers , Graphs and Combinatorics • 1995

Similar Papers

Loading similar papers…