Hypergraph packing and sparse bipartite Ramsey numbers

Combinatorics Probability and Computing

Volumn 18, Issue 6, 2009, Pages 913-923

  Conlon, David ^a  

^a ST JOHN S COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; HYPERGRAPH; MAXIMUM DEGREE; PROBABILISTIC ARGUMENTS; RAMSEY NUMBERS;

EID: 74149091159     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548309990174     Document Type: Article

References (25)

1. Alon, N. (1994) Subdivided graphs have linear Ramsey numbers. J. Graph Theory 18 343-347.
2. Alon, N., Krivelevich, M. and Sudakov, B. (2003) Tur ́an numbers of bipartite graphs and related Ramsey-type questions. Combin. Probab. Comput. 12 477-494.
3. Beck, J. (1983) An upper bound for diagonal Ramsey numbers. Studia Sci. Math. Hungar. 18 401-406.
4. Burr, S. A. and Erdos, P. (1975) On the magnitude of generalized Ramsey numbers for graphs. In Infinite and Finite Combinatorics 1, Vol.10 of Colloq. Math. Soc. J́anos Bolyai, pp. 214-240.
5. Chen, G. and Schelp, R. (1993) Graphs with linearly bounded Ramsey numbers. J. Combin. Theory Ser. B 57 138-149.
6. Chung, F. and Graham, R. L. (1998) Erd?os on Graphs: His Legacy of Unsolved Problems, A. K. Peters, Wellesley, MA.
7. Chv́ atal, V., Rödl, V., Szemeŕedi, E. and Trotter Jr., W. T. (1983) The Ramsey number of a graph with bounded maximum degree. J. Combin. Theory Ser. B 34 239-243.
8. Eaton, N. (1998) Ramsey numbers for sparse graphs. Discrete Math. 185 63-75.
9. Erdos, P. (1984) On some problems in graph theory, combinatorial analysis and combinatorial number theory. In Graph Theory and Combinatorics (Cambridge 1983), Academic Press, London, pp. 1-17.
10. Erdos, P. and Szekeres, G. (1935) A combinatorial problem in geometry. Compositio Mathematica 2 463-470.
11. Fox, J. and Sudakov, B. Density theorems for bipartite graphs and related Ramsey-type results. Combinatorica, to appear.
12. Gowers, W. T. (1997) Lower bounds of tower type for Szemeŕedi's uniformity lemma. Geom. Funct. Anal. 7 322-337.
13. Gowers, W. T. (1998) A new proof of Szemeŕedi's theorem for arithmetic progressions of length 4. Geom. Funct. Anal. 8 529-551.
14. Graham, R. L., Rödl, V. and Ruciń ski, A. (2000) On graphs with linear Ramsey numbers. J. Graph Theory 35 176-192.
15. Graham, R. L., Rödl, V. and Ruciń ski, A. (2001) On bipartite graphs with linear Ramsey numbers. Combinatorica 21 199-209. (Pubitemid 33571582)
16. Komló s, J. and Simonovits,M. (1996) Szemerédi's regularity lemma and its applications in graph theory. In Combinatorics: Paul Erd?os is Eighty, Vol.2 (Keszthely 1993), Budapest, pp. 295-352.
17. Kostochka, A. and Rödl, V. (2001) On graphs with small Ramsey numbers. J. Graph Theory 37 198-204.
18. Kostochka, A. and Rödl, V. (2004) On graphs with small Ramsey numbers II. Combinatorica 24 389-401.
19. Kostochka, A. and Sudakov, B. (2003) On Ramsey numbers of sparse graphs. Combin. Probab. Comput. 12 627-641.
20. Ramsey, F. P. (1930) On a problem of formal logic. Proc. London Math. Soc. Ser. 2 30 264-286.
21. Rödl, V., Ruciń ski, A. and Taraz, A. (1999) Hypergraph packing and graph embedding. Combin. Probab. Comput. 8 363-376.
22. Sauer, N. and Spencer, J. (1978) Edge disjoint placement of graphs. J. Combin. Theory Ser. B 25 295-302.
23. Shi, L. (2001) Cube Ramsey numbers are polynomial. Random Struct. Alg. 19 99-101.
24. Shi, L. (2007) The tail is cut for Ramsey numbers of cubes. Discrete Math. 307 290-292.
25. Sudakov, B. (2003) A few remarks on Ramsey-Tuŕ an-type problems. J. Combin. Theory Ser. B 88 99-106.