𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with full rank 3-color matrix and few 3-colorings

✍ Scribed by Serguei Norine; Jean-Sébastien Sereni


Book ID
108167442
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
69 KB
Volume
98
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Almost all graphs with average degree 4
✍ Dimitris Achlioptas; Cristopher Moore 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 323 KB

We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., Gðn; p ¼ d=nÞ; are 3-colorable and that a constant fraction of all 4-regular graphs are 3-colorable.