Speaker: Esteban Salgado – IASI YES@IASI – Young Experts Seminars Abstract: Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. I’ll present a brief summary of the results obtained from the attempts to solve…