一、报告题目：Partitioning triangle-free planar graphs into a forest and a linear forest
二、报告人：徐荣兴 博士
三、时 间：2025年12月6日(周六) 15:00-16:00
四、地 点：闻理园A4-305
报告摘要：Raspaud and Wang conjectured that every triangle-free planar graph can be vertex-partitioned into an independent set and a forest. Independently, Kawarabayashi and Thomassen also remarked that this might be true, after providing another proof of a result of Borodin and Glebov, showing this result for planar graphs of girth 5. Subsequently, Dross, Montassier, and Pinlou raised the same question and proved that every triangle-free planar graph can be partitioned into a forest and another forest of maximum degree 5. More recently, Feghali and Samal improved this bound on the maximum degree to 3. In this note, we further improve the result by showing that every triangle-free planar graph can be partitioned into a forest and a linear forest, that is, a forest of maximum degree 2. This is a joint work with Guanwu Liu.
报告人简介：徐荣兴，浙江师范大学讲师。2021年6月博士毕业于浙江师范大学，导师为朱绪鼎教授。2021年7月到2023年6月为中国科学技术大学博士后研究员，合作导师为马杰教授。他的主要研究领域为结构图论，包括图的染色，划分，同态，图中圈等问题。目前主持国家自然科学青年基金和浙江省自然科学青年基金各一项，他在SIDMA, JGT, EJC, E-JC等杂志发表论文10余篇。
欢迎广大师生参加！ 联系人：胡晓雪
