报告人：郝荣霞 教授
报告题目：The shortest cycle covers of some bridgeless cubic graphs
报告时间：2026年5月20日（周三）下午7：00
报告地点：腾讯会议：907-381-1970
主办单位：数学与统计学院、数学研究院、科学技术研究院
报告人简介：
郝荣霞，北京交通大学数学与统计学院教授，博士生导师，主要从图论与网络研究。主持并参与多项国家自然科学基金项目，在国际权威期刊上发表了100余篇学术论文，荣获北京运筹学会青年优秀论文一等奖（2008年）。此外，荣获校级优秀主讲教师、北京交通大学“我最敬爱的老师”、教学名师奖等荣誉称号。
报告摘要：
A shortest even subgraph cover of a graph $G$ is a family of even subgraphs which together cover all the edges of $G$ and the sum of their lengths is minimum. It is conjectured that every bridgeless graph has an even subgraph cover with total length at most $\frac{21}{15}|E|$ (called the SCC conjecture). In this talk, we first introduce a new approach to attack this conjecture by combining the even subgraph double cover conjecture (CDC conjecture), and then apply it to present a close relationship between the 4-even subgraph cover and the SCC conjecture. The SCC conjecture are verified for cubic graphs with cyclic odd‐edge‐connectivity at least 29.