Cookie Setting MathNet Korea

이전페이지 이동
3-coloring triangle-free planar graphs
[2017 Discrete Math 세미나]
Date: 2017-03-07
Speaker : Bernard Lidicky (Iowa State University)
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.
VOD : [Android_VOD]    [iPhone_VOD]    [Windows_VOD]
Information Center for Mathematical Sciences KAIST
305-701 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8195~6 / 팩스 042-350-5722
e-mail :
Copyright (C) 2011. ICMS All Rights Reserved.