Ramsey numbers involving graphs with large degrees
โ Scribed by Lin Dong; Yusheng Li; Qizhong Lin
- Book ID
- 108052477
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 307 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The Ramsey number r ( G , H ) is evaluated exactly in certain cases in which both G and H are complete multipartite graphs K(n,, n2, ..., n k ) . Specifically, each of the following cases is handled whenever n is sufficiently large: r(K(1, m,, ..., m k ) , K(1, n)), r(K(1, m), K(n,, ..., nk, n)), pr
For graphs G and H we write G wร ind H if every 2-edge colouring of G yields an induced monochromatic copy of H. The induced Ramsey number for H is defined as r ind (H)=min[ |V(G)|: G wร ind H]. We show that for every d 1 there exists an absolute constant c d such that r ind (H n, d ) n cd for every