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. 
Vincent Cohen-Addad, Michael Hebdige, Daniel Kral, Zhentao Li, Esteban   Salgado
math.CO