报告名称：List colouring of planar graphs

报告专家：朱绪鼎

专家所在单位：浙江师范大学

报告时间：2023年6月19日15:00 -18:00

报告地点: 英国立博官网中文版201

专家简介：朱绪鼎，男，现为浙江师范大学特聘教授、博士生导师，浙江师范大学离散数学研究中心主任。2010年国家级人才计划入选者。研究专长是图论、算法和组合优化。主持国家自然科学面上项目4项，浙江省自然科学重点项目1项。发表论文250余篇，论文被引用2500余次(MathSciNet)。二十多次应邀在重要的国际学术会议上作大会报告。现任J. Graph Theory, European J. Combin., Discrete Math., Contrib. Discrete Math., Discuss. Math. Graph Theory, Bulletin of Academia Sinica, Bulletin of Academia, Taiwanese J. Math 等国际学术期刊编委。

报告摘要：Thomassen proved that every planar graph is 5-choosable and Voigt showed that there are planar graphs that are not 4-choosable. A question that I have been interested in is “how far can a planar graph from being 4-choosable?” is every planar  “almost 4-choosable?” or  some planar graphs are  “far from being 4-choosable?”  I will discuss what could it mean by “almost 4-choosable”, and survey results and open problems motivated by this question.