✦ LIBER ✦

The chromatic number of random graphs at the double-jump threshold

✍ Scribed by T. Łuczak; J. C. Wierman

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 487 KB
Volume: 9
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02122682

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The chromatic number of random graphs

✍ B. Bollobás 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 327 KB

The chromatic number of random graphs

✍ Tomasz Łuczak 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 357 KB

The concentration of the chromatic numbe

The concentration of the chromatic number of random graphs

✍ Noga Alon; Michael Krivelevich 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 579 KB

The generalized acyclic edge chromatic n

The generalized acyclic edge chromatic number of random regular graphs

✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d

On the chromatic forcing number of a ran

On the chromatic forcing number of a random graph

✍ Colin McDiarmid 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 549 KB

On the chromatic number of a random 5-re

On the chromatic number of a random 5-regular graph

✍ J. Díaz; A. C. Kaporis; G. D. Kemkes; L. M. Kirousis; X. Pérez; N. Wormald 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

## Abstract It was only recently shown by Shi and Wormald, using the differential equation method to analyze an appropriate algorithm, that a random 5‐regular graph asymptotically almost surely has chromatic number at most 4. Here, we show that the chromatic number of a random 5‐regular graph is as