๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


A ramsey-theoretic result involving chro
โœ Stefan A. Burr ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 89 KB

## 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__~.

Large Chromatic Number and Ramsey Graphs
โœ Csaba Birรณ, Zoltรกn Fรผredi, Sogol Jahanbekam ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 166 KB
The chromatic Ramsey number of odd wheel
โœ Nathalie Paul; Claude Tardif ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 110 KB

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

Size ramsey numbers of stars versus 4-ch
โœ Oleg Pikhurko ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 124 KB ๐Ÿ‘ 1 views

## 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