On the co-degree threshold for the Fano plane

Details On the co-degree threshold for the Fano plane On the co-degree threshold for the Fano plane

2012-04-09

arxiv.org/abs/1204.1927v1

Mathematics

Combinatorics

10 pages, 2 figures

Scientific paper

Given a 3-graph H, let \ex_2(n, H) denote the maximum codegree of a 3-graph on n vertices which does not contain a copy of H. Let F denote the Fano plane, which is the 3-graph \{axx',ayy',azz',xyz',xy'z,x'yz,x'y'z'\}. Mubayi proved that \ex_2(n,F)=(1/2+o(1))n and conjectured that \ex_2(n, F)=\floor{n/2} for sufficiently large n. Using a very sophisticated quasi-randomness argument, Keevash proved Mubayi's conjecture. Here we give a simple proof of Mubayi's conjecture by using a class of 3-graphs that we call rings. We also determine the Tur\'an density of the family of rings.

Affiliated with

Also associated with

No associations

Rating

On the co-degree threshold for the Fano plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the co-degree threshold for the Fano plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the co-degree threshold for the Fano plane will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-652192