报告题目：The Berge-Fulkerson conjecture for some snarks
报 告 人：郝荣霞（北京交通大学 教授）
报告时间：2021年5月27日 下午14:30开始
报告地点：腾讯会议线上报告
会议链接：//meeting.tencent.com/s/uWcVO5RFLY1G
会议ID：329 828 559
报告摘要：It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two of them. The Berge-Fulkerson Conjecture holds for 3-edge-colorable cubic graphs. A cubic graph is a snark if it is
bridgeless and not 3-edge-colorable. In this talk, the Berge-Fulkerson conjecture is verified for some permutation graphs and an infinite family of cyclically 6-edge-connected snarks. These are joint works with Siyan Liu, Cun-Quan Zhang and Ting Zheng.
报告人简介：郝荣霞，北京交通大学教授,博士生导师。北京运筹学会青年优秀论文一等奖，校教学名师、智瑾奖教优秀教师、巾帼十杰等奖项获得者。中国运筹学会图论组合分会第五届理事。在European J. Combin.、J. Graph Theory、 IEEE Trans. Comput.、IEEE TPDS、Inform. Sci.等国际SCI期刊发表论文80余篇。主持和参加国家自然科学基金面上项目多项。国际期刊《International Journal of Computer Mathematics：Computer Systems Theory》杂志编委，美 国数学会《Mathematical Reviews》评论员。
