On the Codegree Density of Complete 3-Graphs and Related Problems

Given a family of 3-graphs F its codegree threshold coex(n, F) is the largest number d=d(n) such that there exists an n-vertex 3-graph in which every pair of vertices is contained in at least d 3-edges but which contains no member of F as a subgraph. The codegree density gamma(F) is the limit of coex(n,F)/(n-2) as n tends to infinity. In this paper we generalise a construction of Czygrinow and Nagle to bound below the codegree density of complete 3-graphs: for all integers s>3, the codegree density of the complete 3-graph on s vertices K_s satisfies gamma(K_s)\geq 1-1/(s-2). We also provide constructions based on Steiner triple systems which show that if this lower bound is sharp, then we do not have stability in general. In addition we prove bounds on the codegree density for two other infinite families of 3-graphs.

[1]  Yi Zhao,et al.  Co-degree density of hypergraphs , 2007, J. Comb. Theory, Ser. A.

[2]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .

[3]  Alexander Sidorenko,et al.  What we know and what we do not know about Turán numbers , 1995, Graphs Comb..

[4]  VICTOR FALGAS-RAVRY,et al.  Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs , 2013, Comb. Probab. Comput..

[5]  Allan Lo,et al.  $\ell$-degree Tur\'an density , 2012 .

[6]  Béla Bollobás,et al.  Daisies and Other Turán Problems , 2011, Combinatorics, Probability and Computing.

[7]  Brendan Nagle.  TURAN RELATED PROBLEMS FOR HYPERGRAPHS , 1999 .

[8]  Klas Markström,et al.  {l}-degree Tur\'an density , 2012 .

[9]  Dhruv Mubayi.  The co-degree density of the Fano plane , 2005, J. Comb. Theory, Ser. B.

[10]  Oleg Pikhurko,et al.  The Codegree Threshold for 3-Graphs with Independent Neighborhoods , 2015, SIAM J. Discret. Math..

[11]  Zoltán Füredi,et al.  An exact result for 3-graphs , 1984, Discret. Math..

[12]  M. Simonovits,et al.  On Triple Systems with Independent Neighbourhoods , 2005, Combinatorics, Probability and Computing.

[13]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[14]  Peter Keevash.  Surveys in Combinatorics 2011: Hypergraph Turán problems , 2011 .

[15]  Louis DeBiasio,et al.  On the co-degree threshold for the Fano plane , 2014, Eur. J. Comb..

[16]  Klas Markström,et al.  ℓ-Degree Turán Density , 2014, SIAM J. Discret. Math..

[17]  Peter Keevash,et al.  A hypergraph regularity method for generalized Turán problems , 2008 .