April 25, 2016

Steinberg’s Conjecture is false

In 1976, Steinberg conjectured that every planar graph with no cycles of length 4 or 5 is 3-colorable. Very recently, Cohen-Addad, Hebdige, Kral, Li, and Salgado disproved this conjecture by constructing a counterexample. I will present their construction and proof in this talk.