报告题目：Some results on Reconfiguration graphs
报告时间：2024年9月26日（周四）10:30-11:30
报告地点：腾讯会议：341-400-790
报告摘要：For any positive integer $k$, the reconfiguration graph for all $k$-colorings of a graph $G$, denoted by $\mathcal{R}_k(G)$, is the graph where vertices represent the $k$-colorings of $G$, and two $k$-colorings are joined by an edge if they differ in color on exactly one vertex. As a major problem in the field of reconfigurations for vertex colorings of graphs, the connectivity of $\mathcal{R}_k(G)$ has attracted widespread interest. In this talk, we will survey recent developments, particularly introducing relevant results on $P_\ell$-free graphs, along with some of our recent progress in this area.
报告人简介：史永堂，南开大学教授、博导。主要研究领域是图论与组合优化。曾获国家自然科学基金项目、天津市基金项目等资助；获评天津市优秀青年研究生导师、第18届霍英东教育基金会青年科学奖二等奖、中国工业与应用数学学会应用数学青年科技奖、中国运筹学会青年科技奖等。担任中国运筹学会理事、图论组合专委会副理事长，中国工业与应用数学学会图论组合及其应用专委会常务委员，天津市工业与应用数学学会副理事长兼秘书长等。