Induced Ramsey numbers

Combinatorica

Volumn 18, Issue 3, 1998, Pages 373-404

  Kohayakawa, Y ^a   Promel H J ^c   Rodl V ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b EMORY UNIVERSITY   (United States)

^c HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032443360     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009828     Document Type: Article

References (17)

1. J. BECK: On size Ramsey number of paths, trees, and circuits II, in: Mathematics of Ramsey Theory, Algorithms and Combinatorics, vol. 5, Springer-Verlag, Berlin, 1990, 34-45.
2. J. I. BROWN and V. RÖDL: A Ramsey type problem concerning vertex colourings, J. Combin. Theory, Ser. B 52 (1) (1991), 45-52.
3. V. CHVÁTAL, V. RÖDL, E. SZEMERÉDI, and W. T. TROTTER: The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory, Ser. B, 34 (3) (1983), 239-243.
4. W. DEUBER: A generalization of Ramsey's theorem, Infinite and Finite Sets (Keszthely, 1973) (A. Hajnal, R. Rado, and V. T. Sós, eds.), Colloquia Mathematica Societatis János Bolyai, vol. 10, North-Holland, 1975, 323-332.
5. N. EATON and V. RÓDL: A canonical Ramsey theorem, Random Structures and Algorithms, 3 (4) (1992), 427-444.
6. P. ERDOS: Problems and results on finite and infinite graphs, Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), (loose errata) Academia, Prague, 1975, 183-192.
7. P. ERDOS: On some problems in graph theory, combinatorial analysis and combinatorial number theory, Graph theory and combinatorics (Cambridge, 1983) (B. Bollobás, ed.), Academic Press, London, New York, 1984, 1-17.
8. P. ERDOS and A. HAJNAL: Ramsey-type theorems, Discrete Applied Mathematics, 25 (1-2), (1989), 37-52.
9. P. ERDOS, A. HAJNAL, and L. PÓSA: Strong embeddings of graphs into colored graphs, Infinite and Finite Sets (Keszthely, 1973) (A. Hajnal, R. Rado, and V. T. Sós, eds.), Colloquia Mathematica Societatis János Bolyai, vol. 10, North-Holland, 1975, 585-595.
10. R. L. GRAHAM and V. RÖDL: Numbers in Ramsey theory, Surveys in Combinatorics 1987 (C. Whitehead, ed.), London Mathematical Society Lecture Note Series, vol. 123, Cambridge University Press, Cambridge-New York, 1987, 112-153.
11. R. L. GRAHAM, B. ROTHSCHILD, and J. H. SPENCER: Ramsey theory, second ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, 1990.
12. T. LUCZAK and V. RÖDL: On induced Ramsey numbers for graphs with bounded maximum degree, J. Combin. Theory, Ser. B, 66 (2), (1996), 324-333.
13. J. NEŠETŘIL: Ramsey theory, Handbook of Combinatorics (R. L. Graham, M. Grötschel, and L. Lovász, eds.), North-Holland, Amsterdam, 1995, 1331-1403.
14. P.P. RAMSEY: On a problem of formal logic, Proceedings of the London Mathematical Society, 30 (1930), 264-286.
15. V. RÖDL: The dimension of a graph and generalized Ramsey theorems, Master's thesis, Charles University, 1973.
16. V. RÖDL: On universality of graphs with uniformly distributed edges, Discrete Mathematics, 59 (1-2) (1986), 125-134.
17. V. RÖDL and P. WINKLER: A Ramsey-type theorem for orderings of a graph, SIAM Journal on Discrete Mathematics, 2 (3) (1989), 402-406.