Chromatic Ramsey numbers
โ Scribed by Xuding Zhu
- Book ID
- 108316248
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 431 KB
- Volume
- 190
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract The following result is proved. A graph __G__ can be expressed as the edgeโdisjoint union of __k__ graphs having chromatic numbers no greater than __m__~1~,โฆ,__m__~__k__~, respectively, iff ฯ(__G__) โค __m__~1~โฆ__m__~__k__~.
We prove that the chromatic Ramsey number of every odd wheel W 2k+1 , k โฅ 2 is 14. That is, for every odd wheel W 2k+1 , there exists a 14-chromatic graph F such that when the edges of F are two-coloured, there is a monochromatic copy of W 2k+1 in F, and no graph F with chromatic number 13 has the s
## Abstract We investigate the asymptotics of the size Ramsey number __รฎ__(__K__~1,__n__~__F__), where __K__~1,__n__~ is the __n__โstar and __F__ is a fixed graph. The author 11 has recently proved that __rฬ__(__K__~1,n~,__F__)=(1+__o__(1))__n__^2^ for any __F__ with chromatic number ฯ(__F__)=3. He