✦ LIBER ✦

The chromatic number of random graphs

✍ Scribed by B. Bollobás

Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 327 KB
Volume: 8
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02122551

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ 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 chromatic number of random graphs at

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

✍ T. Łuczak; J. C. Wierman 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 487 KB

A note on the sharp concentration of the

A note on the sharp concentration of the chromatic number of random graphs

✍ Tomasz Luczak 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 108 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