History and solution of Steinberg’s conjecture

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 this conjecture as well as a counterexample that disproof it.
Location: Roma, Via dei Taurini 19, Aula Piano Terra
Date:  February 27, 2019  time 11.30 
Contact person: Claudio Gentile

Leave a Reply

Your email address will not be published. Required fields are marked *