On Ramsey numbers of uniform hypergraphs with given maximum degree

Journal of Combinatorial Theory. Series A

Volumn 113, Issue 7, 2006, Pages 1555-1564

  Kostochka, A V ^a,b   Rodl V ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^c EMORY UNIVERSITY   (United States)

Author keywords

Maximum degree; Ramsey numbers; Uniform hypergraphs

Indexed keywords

EID: 33746630986     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2005.12.007     Document Type: Article

References (13)

1. Alon N. Subdivided graphs have linear Ramsey numbers. J. Graph Theory 18 (1984) 343-347
2. Burr S.A., and Erdo{combining double acute accent}s P. On the magnitude of generalized Ramsey numbers for graphs. Infinite and Finite Sets, vol. 1. Colloq. Math. Soc. János Bolyai vol. 10 (1975), North-Holland, Amsterdam 214-240
3. Chen G., and Schelp R.H. Graphs with linearly bounded Ramsey numbers. J. Combin. Theory Ser. B 57 (1993) 138-149
4. Chvátal C., Rödl V., Szemerédi E., and Trotter W.T. The Ramsey number of a graph with bounded maximum degree. J. Combin. Theory Ser. B 34 (1983) 239-243
5. Erdo{combining double acute accent}s P., Frankl P., and Rödl V. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin. 2 2 (1986) 113-121
6. n-free graphs. Colloquio Internazionale sulle Teorie Combinatorie, Tomo II, Rome, 1973. Atti dei Convegni Lincei vol. 17 (1976), Accad. Naz. Lincei, Rome 19-27 (in English, Italian summary)
7. Kostochka A., and Rödl V. On graphs with small Ramsey numbers. J. Graph Theory 37 (2001) 198-204
8. Kostochka A.V., and Rödl V. On graphs with small Ramsey numbers II. Combinatorica 24 3 (2004) 389-401
9. Kostochka A.V., and Sudakov B. On Ramsey numbers of sparse graphs. Combin. Probab. Comput. 12 (2003) 627-641
10. Rödl V., and Thomas R. Arrangeability and clique subdivisions. In: Graham R., and Nešetřil J. (Eds). The Mathematics of Paul Erdo{combining double acute accent}s vol. 2 (1997), Springer-Verlag, Berlin 236-239
11. Shearer J. A note on the independence number of triangle-free graphs. Discrete Math. 46 1 (1983) 83-87
12. Spencer J. Asymptotic lower bounds for Ramsey functions. Discrete Math. 20 1 (1977) 69-76
13. Erdo{combining double acute accent}s P., and Spencer J. Probabilistic Methods in Combinatorics (1974), Academic Press, New York