◈ 학술지
◈ 도서
◈ 전자학술지
◈ 투고요령
◈ 수학신간도서
◈ MSC
◈ 논문검색
◈ 학술행사
홈 > 학술정보 >학술행사 > 세미나
KAIST Discrete Math 세미나

Title
3-coloring triangle-free planar graphs
Speaker
Bernard Lidický   (Iowa State University )
Date
2017-03-07 16:00:00
Host
KAIST
Place
자연과학동 E6-1, ROOM 1409
Abstract
A well known theorem of Grötzsch states that every planar graph is 3-colorable. We will show a simple proof based on a recent result of Kostochka and Yancey on the number of edges in 4-critical graphs. Then we show a strengthening of the Grötzsch’s theorem in several different directions. Based on joint works with Ilkyoo Choi, Jan Ekstein, Zdeněk Dvořák, Přemek Holub, Alexandr Kostochka, and Matthew Yancey.
개인정보보호정책 l 이메일주소집단수집금지 l 뷰어다운로드
qr코드