Steinberg's Conjecture is false
Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.
math.CO↗
arXiv subjects
Esteban Salgado
Publications and source records attributed to Esteban Salgado.