【校庆报告】Coloring graphs without subdivisions of $K_5$

10月24日9:00-10:00  腾讯会议ID：686296288

The Four Color Theorem states that planar graphs are 4-colorable. Planar graphs are precisely the graphs that contain no subdivision of $K_5$ or $K_{3,3}$. Are graphs containing no subdivision of $K_5$ also 4-colorable? This was conjectured by Haj\'{o}s in 1950s. We will discuss progress on this conjecture, as well as related problems about graph structures.