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 ✦
Upper bounds on probability thresholds for asymmetric Ramsey properties
✍ Scribed by Yoshiharu Kohayakawa; Mathias Schacht; Reto Spöhel
- Book ID
- 112187424
- Publisher
- John Wiley and Sons
- Year
- 2012
- Tongue
- English
- Weight
- 239 KB
- Volume
- 44
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Threshold functions for asymmetric Ramse
✍
Y. Kohayakawa; B. Kreuter
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 338 KB
👁 1 views
A note on upper bounds for some Ramsey n
✍
Chiê Nara; Shun-ichi Tachibana
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 345 KB
We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.
Threshold functions for asymmetric Ramse
✍
Bernd Kreuter
📂
Article
📅
1996
🏛
John Wiley and Sons
🌐
English
⚖ 668 KB
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 val
Some Upper Bounds on Error Probability f
✍
Toussaint, G.T.
📂
Article
📅
1971
🏛
IEEE
🌐
English
⚖ 282 KB
Upper bound on the success probability f
✍
Daowen Qiu
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 65 KB
On Upper Bounds for the Decoding Error P
✍
M. V. Burnashev
📂
Article
📅
2001
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 218 KB