Ramsey numbers for sparse graphs

Discrete Mathematics

Volumn 185, Issue 1-3, 1998, Pages 63-75

  Eaton, Nancy ^a  

^a University of Rhode Island   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007371453     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00184-2     Document Type: Article

References (9)

1. S.A. Burr, P. Erdos, On the magnitude of generalized Ramsey numbers for graphs, Colloquia Mathematica Societatis Janos Bolyai 10 Infinite and Finite Sets, vol. 1, North-Holland, Amsterdam, 1975, pp. 214-240.
2. G. Chen, R.H. Schelp, Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B 57 (1) (1993) 138-149.
3. V. Chvátal, V. Rödl, E. Szemerédi, W.T. Trotter Jr., The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (3) (1983) 239-243.
4. R. Duke, H. Leffmann, V. Rödl, A fast approximation algorithm for computing the frequencies of subgraphs in a given graph, SIAM J. Comput. 34 (3) (1995) 598-620.
5. N. Eaton, Some results in graph Ramsey theory and graph representations, Ph.D. Thesis, Mathematics Department, Emory University, 1992.
6. N. Eaton, V. Rödl, A Regularity Lemma, Tech. Report, Mathematics Department, Emory University, 1992.
7. P. Erdos, G. Szekeres, A combinatorial problem in geometry, Composito Math. 2 (1935) 465-470.
8. V. Rödl, R. Thomas, Arrangeability and clique subdivisions, in: R.L. Graham, J. Nešetřil (Eds.), The Mathematics of Paul Erdos, Springer, Berlin, 1991, pp. 236-239.
9. E. Szemerédi, Regular partitions of graphs, in: J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, D. Sotteau (Eds.), Proc. Colloque Inter. CNRS., 1976, pp. 399-401.