报告方式：线上报告，腾讯会议：832796994
邀请人：张晓岩教授
摘要：
A graph is even cycle decomposable if its edges can be partitioned into cycles of even length. A graph G is strongly even cycle decomposable if every subdivision of G with an even number of edges is even cycle decomposable. Markström conjectured that for any 2-connected cubic graph G, its line graph L(G) is even cycle decomposable. Máčajová and Mazák further asked whether L(G) is strongly even cycle decomposable. In this talk, we will present some recent progress on these problems.
简介：
崔庆，南京航空航天大学数学系副教授，硕士生导师。2009年博士毕业于南开大学，2017年在美国佐治亚州立大学交流访学。主要研究方向为结构图论，主持国家自然科学基金青年科学基金、中国博士后科学基金等项目，目前在Journal of Combinatorial Theory, Series B、Journal of Graph Theory、Discrete Mathematics等期刊发表学术论文20余篇。