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

Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6,23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to κ-uniform hypergraphs for any integer κ ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for κ-uniform hypergraphs of bounded maximum degree into suitable κ-uniform ‘quasi-random’ hypergraphs.

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

Access this article

Log in via an institution

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

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Chen and R. Schelp: Graphs with linearly bounded Ramsey numbers, J. Combinatorial Theory B 57 (1993), 138–149.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. A. Burr and P. Erdős: On the magnitude of generalized Ramsey numbers for graphs; in: Infinite and Finite Sets I., Colloquia Mathematica Societatis János Bolyai vol. 10 (1975), 214–240.

    Google Scholar 

  3. V. Chvátal, V. Rödl, E. Szemerédi and W. T. Trotter, Jr.: The Ramsey number of a graph with a bounded maximum degree, J. Combinatorial Theory B 34 (1983), 239–243.

    Article  MATH  Google Scholar 

  4. D. Conlon, J. Fox and B. Sudakov: Ramsey numbers of sparse hypergraphs, Random Structures & Algorithms, to appear.

  5. O. Cooley: Ph.D. thesis, University of Birmingham, in preparation.

  6. O. Cooley, N. Fountoulakis, D. Kühn and D. Osthus: 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, J. Combinatorial Theory B 98 (2008), 484–505.

    Article  MATH  Google Scholar 

  7. P. Erdős and R. Rado: Combinatorial theorems on classifications of subsets of a given set, Proc. London Mathematical Society 3 (1952), 417–439.

    Article  Google Scholar 

  8. P. Frankl and V. Rödl: Extremal problems on set systems, Random Structures & Algorithms 20 (2002), 131–164.

    Article  MATH  MathSciNet  Google Scholar 

  9. W. T. Gowers: Hypergraph regularity and the multidimensional Szemerédi theorem, Ann. of Math. 166 (2007), 897–946.

    Article  MATH  MathSciNet  Google Scholar 

  10. W. T. Gowers: Quasirandomness, counting and regularity for 3-uniform hypergraphs; Combinatorics, Probability & Computing 15 (2006), 143–184.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. L. Graham, B. L. Rothschild and J. H. Spencer: Ramsey Theory, John Wiley & Sons, 1980.

  12. R. L. Graham, V. Rödl and A. Ruciński: On graphs with linear Ramsey numbers, J. Graph Theory 35 (2000), 176–192.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Gyárfás, J. Lehel, G. N. Sárközy and R. Schelp: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, J. Combinatorial Theory B 98 (2008), 342–358.

    Article  MATH  Google Scholar 

  14. P. E. Haxell, T. Łuczak, Y. Peng, V. Rödl, A. Ruciński, M. Simonovits and J. Skokan: The Ramsey number for hypergraph cycles I, J. Combinatorial Theory A 113 (2006), 67–83.

    Article  MATH  Google Scholar 

  15. P. E. Haxell, T. Łuczak, Y. Peng, V. Rödl, A. Ruciński and J. Skokan: The Ramsey number for 3-uniform tight hypergraph cycles, Combinatorics, Probability & Computing 18 (2009), 165–203.

    Article  Google Scholar 

  16. Y. Ishigami: Linear Ramsey numbers for bounded-degree hypergraphs, preprint.

  17. P. Keevash: A hypergraph blowup lemma, preprint.

  18. Y. Kohayakawa, V. Rödl and J. Skokan: Hypergraphs, quasi-randomness, and conditions for regularity; J. Combinatorial Theory A 97 (2002), 307–352.

    Article  MATH  Google Scholar 

  19. J. Komlós, G. Sárkőzy and E. Szemerédi: The blow-up lemma, Combinatorica 17 (1997), 109–123.

    Article  MATH  MathSciNet  Google Scholar 

  20. J. Komlós and M. Simonovits: Szemerédi’s Regularity Lemma and its applications in graph theory, Bolyai Society Mathematical Studies 2, Combinatorics, Paul Erdós is Eighty, (Vol. 2) (D. Miklós, V. T. Sós and T. Szőnyi eds.), Budapest (1996), 295–352.

  21. A. Kostochka and V. Rödl: On Ramsey numbers of uniform hypergraphs with given maximum degree, J. Combinatorial Theory A 113 (2006), 1555–1564.

    Article  MATH  Google Scholar 

  22. D. Kühn and D. Osthus: Loose Hamilton cycles in 3-uniform hypergraphs of large minimum degree, J. Combinatorial Theory B 96 (2006), 767–821.

    Article  MATH  Google Scholar 

  23. B. Nagle, S. Olsen, V. Rödl and M. Schacht: On the Ramsey number of sparse 3-graphs, Graphs and Combinatorics 24 (2008), 205–228.

    Article  MATH  MathSciNet  Google Scholar 

  24. B. Nagle and V. Rödl: Regularity properties for triple systems, Random Structures & Algorithms 23 (2003), 264–332.

    Article  MATH  MathSciNet  Google Scholar 

  25. B. Nagle, V. Rödl and M. Schacht: The counting lemma for κ-uniform hypergraphs, Random Structures & Algorithms 28 (2006), 113–179.

    Article  MATH  MathSciNet  Google Scholar 

  26. J. Polcyn, V. Rödl, A. Ruciński and E. Szemerédi: Short paths in quasi-random triple systems with sparse underlying graphs, J. Combinatorial Theory B 96 (2006), 584–607.

    Article  MATH  Google Scholar 

  27. V. Rödl and M. Schacht: Regular partitions of hypergraphs: Regularity Lemma; Combinatorics, Probability & Computing 16 (2007), 833–885.

    MATH  Google Scholar 

  28. V. Rödl and M. Schacht: Regular partitions of hypergraphs: Counting Lemmas; Combinatorics, Probability & Computing 16 (2007), 887–901.

    MATH  Google Scholar 

  29. V. Rödl and J. Skokan: Regularity lemma for κ-uniform hypergraphs, Random Structures & Algorithms 25 (2004), 1–42.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn & Deryk Osthus

Authors
  1. Oliver Cooley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikolaos Fountoulakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniela Kühn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Deryk Osthus
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deryk Osthus.

Additional information

N. Fountoulakis and D. Kühn were supported by EPSRC, grant no. EP/D50564X/1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cooley, O., Fountoulakis, N., Kühn, D. et al. Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs. Combinatorica 29, 263–297 (2009). https://doi.org/10.1007/s00493-009-2356-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-009-2356-y

Mathematics Subject Classification (2000)

Search

Navigation