[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Hypergraphs with Minimum Positive Uniform Turán Density

  • Conference paper
  • First Online:
Extended Abstracts EuroComb 2021

Part of the book series: Trends in Mathematics ((RPCRMB,volume 14))

  • 1249 Accesses

Abstract

Reiher, Rödl and Schacht [J. London Math. Soc. 97 (2018), 77–97] showed that the uniform Turán density of every 3-uniform hypergraph is either 0 or at least 1/27, and asked whether there exist 3-uniform hypergraphs with uniform Turán density equal or arbitrarily close to 1/27. We construct 3-uniform hypergraphs with uniform Turán density equal to 1/27.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 119.50
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 149.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Baber, R., Talbot, J.: Hypergraphs do jump. Combin. Probab. Comput. 20, 161–171 (2011)

    Article  MathSciNet  Google Scholar 

  2. Erdős, P.: Problems, results on graphs, hypergraphs: similarities, differences. In: Nešetřil, J., Rödl, V. (eds.) Mathematics of Ramsey Theory, pp. 223–233 (1990)

    Google Scholar 

  3. Erdős, P., Simonovits, M.: A limit theorem in graph theory. Studia Sci. Math. Hungar. 1, 51–57 (1966)

    MathSciNet  MATH  Google Scholar 

  4. Erdős, P., Sós, T.V.: On Ramsey-Turán type theorems for hypergraphs. Combinatorica 2, 289–295 (1982)

    Article  MathSciNet  Google Scholar 

  5. Erdős, P., Stone, H.A.: On the structure of linear graphs. Bull. Amer. Math. Soc. 52, 1087–1091 (1946). https://doi.org/10.1007/BF02759702

    Article  MathSciNet  MATH  Google Scholar 

  6. Frankl, P., Füredi, Z.: An exact result for 3-graphs. Discret. Math. 50, 323–328 (1984)

    Article  MathSciNet  Google Scholar 

  7. Füredi, Z.: A proof of the stability of extremal graphs, Simonovits’ stability from Szemerédi’s regularity. J. Comb. Theory Ser. B 115, 66–71 (2015)

    Article  Google Scholar 

  8. Glebov, R., Král’, D., Volec, J.: A problem of Erdős and Sós on 3-graphs. Israel J. Math. 211(1), 349–366 (2016). https://doi.org/10.1007/s11856-015-1267-4

    Article  MathSciNet  MATH  Google Scholar 

  9. Katona, G., Nemetz, T., Simonovits, M.: On a problem of Turán in the theory of graphs. Mat. Lapok 15, 228–238 (1964)

    MathSciNet  MATH  Google Scholar 

  10. Keevash, P.: Hypergraph Turán problems. In: Chapman, R. (ed.) Surveys in Combinatorics 2011. Lecture Note Series, pp. 83–140. London Mathematical Society (2011)

    Google Scholar 

  11. Razborov, A.A.: Flag algebras. J. Symb. Logic 72, 1239–1282 (2007)

    Article  MathSciNet  Google Scholar 

  12. Razborov, A.A.: On 3-hypergraphs with forbidden 4-vertex configurations. SIAM J. Discret. Math. 24, 946–963 (2010)

    Article  MathSciNet  Google Scholar 

  13. Reiher, C.: Extremal problems in uniformly dense hypergraphs. Eur. J. Comb. 88, 103117 (2020)

    Article  MathSciNet  Google Scholar 

  14. Reiher, C., Rödl, V., Schacht, M.: Embedding tetrahedra into quasirandom hypergraphs. J. Comb. Theory Ser. B 121, 229–247 (2016)

    Article  MathSciNet  Google Scholar 

  15. Reiher, C., Rödl, V., Schacht, M.: Hypergraphs with vanishing Turán density in uniformly dense hypergraphs. J. London Math. Soc. 97, 77–97 (2018)

    Article  MathSciNet  Google Scholar 

  16. Reiher, C., Rödl, V., Schacht, M.: On a generalisation of Mantel’s theorem to uniformly dense hypergraphs. Int. Math. Res. Not. 16, 4899–4941 (2018)

    Article  MathSciNet  Google Scholar 

  17. Reiher, C., Rödl, V., Schacht, M.: On a Turán problem in weakly quasirandom 3-uniform hypergraphs. J. Eur. Math. Soc. 20, 1139–1159 (2018)

    Article  MathSciNet  Google Scholar 

  18. Reiher, C., Rödl, V., Schacht, M.: Some remarks on \(\pi \). In: Butler, S., Cooper, J., Hurlbert, G. (eds.) Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham, pp. 214–239 (2018)

    Google Scholar 

  19. Rödl, V.: On universality of graphs with uniformly distributed edges. Discret. Math. 59, 125–134 (1986)

    Article  MathSciNet  Google Scholar 

  20. Simonovits, M.: A method for solving extremal problems in graph theory, stability problems. In: Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 279–319 (1968)

    Google Scholar 

  21. Turán, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 61 (1941)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Jacob Cooper for his comments on the topics covered in this paper.

This work has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 648509). This publication reflects only its authors’ view; the European Research Council Executive Agency is not responsible for any use that may be made of the information it contains. The authors were also supported by the MUNI Award in Science and Humanities of the Grant Agency of Masaryk University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ander Lamaison .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Garbe, F., Král’, D., Lamaison, A. (2021). Hypergraphs with Minimum Positive Uniform Turán Density. In: Nešetřil, J., Perarnau, G., Rué, J., Serra, O. (eds) Extended Abstracts EuroComb 2021. Trends in Mathematics(), vol 14. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-83823-2_24

Download citation

Publish with us

Policies and ethics