Steinberg's Conjecture is false

Abstract

Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.

Several typos fixed