A sharp threshold for random graphs with a monochromatic triangle in every edge coloring / [electronic resource] Ehud Friedgut ... [et al.].
Material type: TextSeries: Memoirs of the American Mathematical Society ; v. 845Publication details: Providence, R.I. : American Mathematical Society, 2006Description: 1 online resource (vi, 66 p. : ill.)ISBN: 9781470404468 (online)Subject(s): Graph coloring | Ramsey theory | Random graphsAdditional physical formats: sharp threshold for random graphs with a monochromatic triangle in every edge coloring /DDC classification: 510 s | 511/.56 LOC classification: QA3 | .A57 no. 845 | QA166.247Online resources: Contents | ContentsCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK13298 |
"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
Description based on print version record.
There are no comments on this title.