The Ramsey numbers for disjoint unions o
โ
Tristan Denley
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 671 KB
As usual, for simple graphs G and H, let the Ramsey number r(G,H) be defined as the least number n such that for any graph K of order n, either G is a subgraph of K or H is a subgraph of/(. We shall establish the values of r(aC~,bCs) and r(aCv, bC7) almost precisely (where nG is the graph consisting