Abstract
The Ramsey numberr(F, G) is determined in the case whereF is an arbitrary fixed graph andG is a sufficiently large sparse connected graph with a restriction on the maximum degree of its vertices. An asymptotically correct upper bound is obtained forr(F, T) whereT is a sufficiently large, but otherwise arbitrary, tree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. A. Bondy andP. Erdős, Ramsey numbers for cycles in graphs.J. Combinatorial Theory (B) 14 (1973), 46–54.
S. A. Burr, Ramsey numbers involving graphs with long suspended paths.J. London Math. Soc. 24 (1981), 405–413.
S. A. Burr, P. Erdős, R. J. Faudree, C. C. Rousseau andR. H. Schelp, Ramsey numbers for the pair sparse graph-path or cycle.Trans. Amer. Math. Soc. 269 (1982), 501–512.
V. Chvátal, Tree-complete graph Ramsey numbers,J. Graph Theory 1 (1977), 93.
R. J. Faudree, C. C. Rousseau andR. H. Schelp, Generalizations of a Ramsey result of Chvátal.The Theory and Applications of Graphs (G. Chartrand, ed.) Wiley, New York (1981), 351–361.
P. Hall, On representations of subsets,J. London Math. Soc. 10 (1935), 26–30.
T. D. Parsons, Ramsey graphs and block designs, I.Trans. Amer. Math. Soc. 209 (1975), 33–44.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Erdős, P., Faudree, R.J., Rousseau, C.C. et al. Multipartite graph—Sparse graph Ramsey numbers. Combinatorica 5, 311–318 (1985). https://doi.org/10.1007/BF02579245
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02579245