Science China Mathematics

, Volume 61, Issue 3, pp 577–592 | Cite as

Dense 3-uniform hypergraphs containing a large clique

Articles
  • 27 Downloads

Abstract

An r-uniform graph G is dense if and only if every proper subgraph G′ of G satisfies λ(G′) < λ(G), where λ(G) is the Lagrangian of a hypergraph G. In 1980’s, Sidorenko showed that π(F), the Turán density of an r-uniform hypergraph F is r! multiplying the supremum of the Lagrangians of all dense F-hom-free r-uniform hypergraphs. This connection has been applied in the estimating Turán density of hypergraphs. When r = 2, the result of Motzkin and Straus shows that a graph is dense if and only if it is a complete graph. However, when r ≥ 3, it becomes much harder to estimate the Lagrangians of r-uniform hypergraphs and to characterize the structure of all dense r-uniform graphs. The main goal of this note is to give some sufficient conditions for 3-uniform graphs with given substructures to be dense. For example, if G is a 3-graph with vertex set [t]and m edges containing [t − 1](3), then G is dense if and only if \(m \geqslant \left( {\frac{{t - 1}}{3}} \right) + \left( {\frac{{t - 2}}{2}} \right) + 1\) . We also give a sufficient condition on the number of edges for a 3-uniform hypergraph containing a large clique minus 1 or 2 edges to be dense.

Keywords

dense hypergraphs Lagrangian of hypergraphs Turán density 

MSC(2010)

05C65 05D05 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant No. 11271116). The authors thank both reviewers for reading the manuscript carefully, checking all the details and giving insightful comments to help improve the manuscript.

References

  1. 1.
    Brandt A, Irwin D, Jiang T. Stability and Turán numbers of a class of hypergraphs via Lagrangians. Combin Probab Comput, 2017, 26: 367–405MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Frankl P, Füredi Z. Extremal problems whose solutions are the blow-ups of the small Witt-designs. J Combin Theory Ser A, 1989, 52: 129–147MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Frankl P, Rödl V. Hypergraphs do not jump. Combinatorica, 1984, 4: 149–159MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Hefetz D, Keevash P. A hypergraph Turán theorem via Lagrangians of intersecting families. J Combin Theory Ser A, 2013, 120: 2020–2038MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Keevash P. Hypergraph Turán problems. In: Surveys in Combinatorics. Cambridge: Cambridge University Press, 2011, 83–140CrossRefMATHGoogle Scholar
  6. 6.
    Motzkin T, Straus E. Maxima for graphs and a new proof of a theorem of Turán. Canad J Math, 1965, 17: 533–540MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Norin S, Yepremyan L. Turán numbers of generalized triangles. ArXiv:1501.01913v1, 2015MATHGoogle Scholar
  8. 8.
    Norin S, Yepremyan L. Turán numbers of extensions. ArXiv:1510.04689, 2015MATHGoogle Scholar
  9. 9.
    Peng Y, Zhao C. A Motzkin-Straus type result for 3-uniform hypergraphs. Graphs Combin, 2013, 29: 681–694MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Sidorenko A. On the maximal number of edges in a uniform hypergraph that does not contain prohibited subgraphs. Mat Zametki, 1987, 41: 247–259MATHGoogle Scholar
  11. 11.
    Sidorenko A. Asymptotic solution for a new class of forbidden r-graphs. Combinatorica, 1989, 9: 207–215MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Talbot J. Lagrangians of hypergraphs. Combin Probab Comput, 2002, 11: 199–216MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Turán P. On an extremal problem in graph theory (in Hungarian). Mat Fiz Lapok, 1941, 48: 436–452MathSciNetGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2017

Authors and Affiliations

  1. 1.College of Mathematics and EconometricsHunan UniversityChangshaChina
  2. 2.Institute of MathematicsHunan UniversityChangshaChina

Personalised recommendations