A sharp threshold for random graphs with a monochromatic triangle in every edge coloring / [electronic resource]
Ehud Friedgut ... [et al.].
- Providence, R.I. : American Mathematical Society, 2006.
- 1 online resource (vi, 66 p. : ill.)
- Memoirs of the American Mathematical Society, v. 845 0065-9266 (print); 1947-6221 (online); .
"Volume 179, number 845 (fourth of 5 numbers)."
Includes bibliographical references (p. 65-66).
1. Introduction 2. Outline of the proof 3. Tepees and constellations 4. Regularity 5. The core section (proof of Lemma 2.4) 6. Random graphs 7. Summary, further remarks, glossary
Access is restricted to licensed institutions
Electronic reproduction.
Providence, Rhode Island :
American Mathematical Society.
2012
Mode of access : World Wide Web
9781470404468 (online)
Graph coloring.
Ramsey theory.
Random graphs.
QA3 QA166.247 / .A57 no. 845
510 s 511/.56
"Volume 179, number 845 (fourth of 5 numbers)."
Includes bibliographical references (p. 65-66).
1. Introduction 2. Outline of the proof 3. Tepees and constellations 4. Regularity 5. The core section (proof of Lemma 2.4) 6. Random graphs 7. Summary, further remarks, glossary
Access is restricted to licensed institutions
Electronic reproduction.
Providence, Rhode Island :
American Mathematical Society.
2012
Mode of access : World Wide Web
9781470404468 (online)
Graph coloring.
Ramsey theory.
Random graphs.
QA3 QA166.247 / .A57 no. 845
510 s 511/.56