讲座主题：The Berge-Fulkerson coloring for some permutation snarks

专家姓名：郝荣霞

工作单位：北京交通大学

讲座时间：2022年5月28日 14:00

讲座地点：腾讯会议：574689876

主办单位：十大网投平台大全下载数学与信息科学学院

内容摘要：

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 BergeFulkerson conjecture holds for 3-edge-colorable cubic graphs. A snark is a cyclically 4-edge connected cubic graph of girth at least 5 admitting no 3-edge coloring. In this talk, the BergeFulkerson conjecture is verified for some permutation snarks including an infinite family of cyclically 5-edge connected snarks constructed by J. Hagglund and A. Hoffmann-Ostenhof. This is a joint work with Siyan Liu, Cun-Quan Zhang and Zhang Zhang.

主讲人介绍：

郝荣霞，北京交通大学教授，博士生导师，主要从事图论与网络的研究。2008年获北京运筹学会青年优秀论文一等奖。主持和参加国家自然科学基金面上项目多项，参加国家自然科学基金重点项目一项。获评北京交通大学“智瑾奖教金优秀青年教师”、“巾帼十杰”、“毕业生我最敬爱的老师”、“教学名师”等荣誉。在Information Sciences、IEEE Transactions on Computer、IEEE Transactions on Parallel and Distributed Systems、Journal of GraphTheory”等期刊发表论文90余篇。担任中国运筹学会图论组合分会第五届理事；国际期刊International Journal of Computer Mathematics: Computer Systems Theory编委；美国数学会 “Mathematical Reviews”评论员。