论文信息 - Multipartite graph—Sparse graph Ramsey numbers

Multipartite graph—Sparse graph Ramsey numbers

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.

Richard H. Schelp | Paul Erdös | Cecil C. Rousseau | Ralph J. Faudree

[1] S. Burr,et al. Ramsey Numbers Involving Graphs with Long Suspended Paths , 1981 .

[2] T. D. Parsons,et al. Ramsey graphs and block designs. I , 1975 .

[3] P. Erdös,et al. Ramsey Numbers for Cycles in Graphs , 1973 .

[4] Vasek Chvátal,et al. Tree-complete graph ramsey numbers , 1977, J. Graph Theory.

[5] Richard H. Schelp,et al. Ramsey numbers for the pair sparse graph-path or cycle , 1982 .

[6] P. Hall. On Representatives of Subsets , 1935 .