## 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
โฆ LIBER โฆ
Size Ramsey Numbers of Stars Versus 3-chromatic Graphs
โ Scribed by Oleg Pikhurko
- Book ID
- 106167890
- Publisher
- Springer-Verlag
- Year
- 2001
- Tongue
- English
- Weight
- 185 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Size ramsey numbers of stars versus 4-ch
โ
Oleg Pikhurko
๐
Article
๐
2003
๐
John Wiley and Sons
๐
English
โ 124 KB
๐ 1 views
Mixed ramsey numbers: Chromatic numbers
โ
James M. Benedict; Gary Chartrand; Don R. Lick
๐
Article
๐
1978
๐
John Wiley and Sons
๐
English
โ 399 KB
Ramsey numbers of stars versus wheels of
โ
Aleksandra Korolova
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 194 KB
Star chromatic numbers of graphs
โ
Eckhard Steffen; Xuding Zhu
๐
Article
๐
1996
๐
Springer-Verlag
๐
English
โ 555 KB
Ramsey Numbers of Some Bipartite Graphs
โ
Tao Jiang; Michael Salerno
๐
Article
๐
2010
๐
Springer Japan
๐
English
โ 147 KB
Star chromatic numbers of some planar gr
โ
Gao, Guogang; Wang, Yiju; Zhou, Huishan
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 173 KB
๐ 2 views
The concept of the star chromatic number of a graph was introduced by Vince (A. Vince, Star chromatic number, J. Graph Theory 12 (1988), 551--559), which is a natural generalization of the chromatic number of a graph. This paper calculates the star chromatic numbers of three infinite families of pla