Ramsey numbers of sparse hypergraphs

Random Structures and Algorithms

Volumn 35, Issue 1, 2009, Pages 1-14

  Conlon, David ^a   Fox, Jacob ^b   Sudakov, Benny ^c,d  

^a ST JOHN S COLLEGE   (United Kingdom)

^b Department of Mathematics ^*  (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Dependent random choice; Hypergraphs; Ramsey numbers; Tur n type theorems

Indexed keywords

EID: 67650668188     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20260     Document Type: Article

References (26)

1. N. Alon, M. Krivelevich, and B. Sudakov, Turán numbers of bipartite graphs and related Ramsey-type questions, Combin Probab Comput 12 (2003), 477-494.
2. S. A. Burr and P. Erdos, On the magnitude of generalized Ramsey numbers for graphs, In: Infinite and finite combinatorics, vol. 1, Colloq Math Soc János Bolyai 10 (1975), 214-240.
3. V. Chvataacute;l, V. Rödl, and E. Szemereacute;di, W. T. Trotter Jr., The Ramsey number of a graph with bounded maximum degree, J Combin Theory Ser B 34 (1983), 239-243.
4. D. Conlon, A new upper bound for diagonal Ramsey numbers, Ann Math, in press.
5. D. Conlon, Hypergraph packing and sparse bipartite Ramsey numbers, Submitted for publication.
6. O. Cooley, N. Fountoulakis, D. Kühn, and D. Osthus, 3-uniformhypergraphsofboundeddegree have linear Ramsey numbers, J Combin Theory Ser B 98 (2008), 484-505.
7. O. Cooley, N. Fountoulakis, D. Kühn, and D. Osthus, Embeddings and Ramsey numbers of sparse k-uniform hypergraphs, Combinatorica, to appear.
8. N. Eaton, Ramsey numbers for sparse graphs, Discrete Math 185 (1998), 63-75.
9. P. Erdos, On some problems in graph theory, combinatorial analysis and combinatorial number theory, In Graph theory and combinatorics (Cambridge, 1983), Academic Press, London-New York, 1984, pp. 1-17.
10. P. Erdos and R. L. Graham, On partition theorems for finite graphs, In: Infinite and finite sets (Colloq., Keszthely, 1973: dedicated to P. Erdos on his 60th birthday), Vol. I; Colloq. Math. Soc. Jaacute;nos Bolyai, Vol.10, North-Holland, Amsterdam, 1975, pp. 515-527.
11. P. Erdos and R. Rado, Combinatorial theorems on classifications of subsets of a given set, Proc London Math Soc 3 (1952), 417-439.
12. J. Fox and B. Sudakov, Density theorems for bipartite graphs and related Ramsey-type results, Combinatorica, to appear.
13. W. T. Gowers, A new proof of Szemerédi's theorem for arithmetic progressions of length four, Geom Funct Analysis 8 (1998), 529-551.
14. W. T. Gowers, Hypergraph regularity and the multidimensional Szemereacute;di theorem, Ann Math 166(2007),897-946.
15. R. L. Graham, V. Rödl, and A. Rucinski, On graphs with linear Ramsey numbers, J Graph Theory 35 (2000), 176-192.
16. R. L. Graham, V. Rödl, and A. Rucinski, On bipartite graphs with linear Ramsey numbers, Combinatorica 21 (2001), 199-209.
17. R. L. Graham, B. L. Rothschild, and J. L. Spencer, Ramsey theory, Wiley, New York, 1980.
18. A. V. Kostochka and V. Rödl, On graphs with small Ramsey numbers, J Graph Theory 37 (2001),198-204.
19. A. V. Kostochka and V. Rödl, On Ramsey numbers of uniform hypergraphs with given maximum degree, J Combin Theory Ser A 113 (2006), 1555-1564.
20. A. V. Kostochka and B. Sudakov, On Ramsey numbers of sparse graphs, Combin Probab Comput 12 (2003), 627-641.
21. B. Nagle, S. Olsen, V. Rödl, and M. Schacht, On the Ramsey number of sparse 3-graphs,Graphs Combinatorics 24 (2008), 205-228.
22. B. Nagle, V. Rödl, and M. Schacht, The counting lemma for k-uniform hypergraphs, Random Struct Algorithms 28 (2006), 113-179.
23. F. P. Ramsey, On a problem of formal logic, Proc London Math Soc Ser 2 30 (1930), 264-286.
24. V. Rödl and J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Struct Algorithms 25 (2004), 1-42.
25. B. Sudakov, Few remarks on the Ramsey-Turán-type problems, J Combin Theory Ser B 88 (2003),99-106.
26. s-free graphs and some other Ramsey-type problems, Random Struct Algorithms 26 (2005), 253-265.