報告人：郝榮霞 教授
報告題目：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.