Steinberg's Conjecture is false
Combinatorics
2016-04-20 v2
Abstract
Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.
Cite
@article{arxiv.1604.05108,
title = {Steinberg's Conjecture is false},
author = {Vincent Cohen-Addad and Michael Hebdige and Daniel Kral and Zhentao Li and Esteban Salgado},
journal= {arXiv preprint arXiv:1604.05108},
year = {2016}
}
Comments
Several typos fixed