𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the -chromatic number of regular graphs without 4-cycle

✍ Scribed by Saeed Shaebani


Book ID
113564788
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
209 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the number of graphs without 4-cycles
✍ Daniel J. Kleitman; Kenneth J. Winston πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 534 KB
On the chromatic number of a random 5-re
✍ 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