We consider the binomial random graph G and determine a sharp threshold p function for the edge-Ramsey property G ยช C l 1 , . . . , C l r ลฝ . p for all l , . . . , l , where C l denotes the cycle of length l. As deterministic consequences of 1 r our results, we prove the existence of sparse graphs
โฆ LIBER โฆ
Threshold functions for asymmetric Ramsey properties with respect to vertex colorings
โ Scribed by Bernd Kreuter
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 668 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
โฆ Synopsis
In this note we investigate Ramsey properties of random graphs. The threshold functions for symmetric Ramsey properties with respect to vertex colorings were determined by tuczak, Rucinski, and Voigt . As a generalization of this problem we consider asymmetric Ramsey properties and establish the values of the threshold functions. Furthermore, we investigate canonical colorings.
๐ SIMILAR VOLUMES
Threshold functions for asymmetric Ramse
โ
Y. Kohayakawa; B. Kreuter
๐
Article
๐
1997
๐
John Wiley and Sons
๐
English
โ 338 KB
๐ 1 views