✦ LIBER ✦

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

✍ Scribed by Tomasz Luczak

Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 108 KB
Volume: 11
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01205080

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

✍ 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

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

A note on the line-distinguishing chroma

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.