论文信息 - Ramsey numbers for matchings

Ramsey numbers for matchings

We consider the Ramsey number r(sK"2, G) where sK"2(s>=1) denotes a set of s disjoint edges and G is an arbitrary finite simple graph with no isolated vertices. We obtain upper and lower bounds in the general case. Exact results are obtained for certain classes of graphs.

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[3] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[4] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.

[5] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .

[6] L. Lovász. Three short proofs in graph theory , 1975 .

[7] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[8] Jack E. Graver,et al. Some graph theoretic results associated with Ramsey's theorem* , 1968 .

[9] Paul A. Catlin,et al. Embedding subgraphs and coloring graphs under extremal degree conditions , 1976 .