Ramsey linear families and generalized subdivided graphs

Discrete Mathematics

Volumn 170, Issue 1-3, 1997, Pages 269-275

  Li, Yusheng ^a   Rousseau, Cecil C ^a   Šoltés, Ľubomír ^b  

^a University of Memphis   (United States)

^b WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041629042     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00311-1     Document Type: Article

References (12)

1. N. Alon, Subdivided graphs have linear Ramsey number, J. Graph Theory 18 (1994) 343-347.
2. S. Burr, Ramsey numbers involving graphs with long suspended paths, J. London Math. Soc. (2) 24 (1981) 405-413.
3. S.A. Burr and P. Erdos, On the magnitude of generalized Ramsey numbers, in: Colloquia Mathematica Societatis János Bolyai 10, Infinite and Finite Sets, vol. 1 (North-Holland, Amsterdam, 1973) 215-240.
4. S. Burr and P. Erdos, Generalization of a Ramsey-theoretic result of Chvátal, J. Graph Theory 7 (1983) 39-45.
5. G. Chen and R.H. Schelp, Graphs with linear bounded Ramsey numbers, J. Combin. Theory B 57 (1993) 138-149.
6. V. Chvátal, Tree-complete graph Ramsey numbers, J. Graph Theory 1 (1977) 93.
7. V. Chvátal, V. Rödl, E. Szemerédi and T. Trotter, The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory B 34 (1983) 239-243.
8. 2,2, in: Graph Theory, Combinatorics, Algorithms, and Applications, in: Y. Alavi et al., eds., Proceedings in Applied Mathematics 5.4, Chapter 19 (SIAM, Philadelphia, PA, 1991) 207-211.
9. 3, G), Discrete Math. 125 (1994) 177-182.
10. Y-S. Li and C.C. Rousseau, Fan-complete graph Ramsey numbers, J. Graph Theory, to appear.
11. V. Rödl and R. Thomas, Arrangeability and clique subdivisions, Preprint.
12. A.F. Sidorenko, The Ramsey number of an N-edge graph versus a triangle is at most 2N + 1, J. Combin. Theory B 58 (1993) 185-196.