Ramsey numbers of stars versus wheels of similar sizes
โ Scribed by Aleksandra Korolova
- Book ID
- 108113518
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 194 KB
- Volume
- 292
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## 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
For two given graphs G 1 and G 2 , the Ramsey number R(G 1 , G 2 ) is the smallest integer n such that for any graph G of order n, either G contains G 1 or the complement of G contains G 2 . Let C n denote a cycle of order n and W m a wheel of order m + 1. It is conjectured by Surahmat, E.T. Baskoro