报告题目：Recent progress of Berge-Fulkerson conjecture for some permutation snarks

报告时间：2022年11月26日（星期六）10:00-12:00

报告平台：腾讯会议 ： 385 873 486

报告人：郝荣霞教授 北京交通大学

报告内容简介：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. Berge-Fulkerson 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 Berge-Fulkerson conjecture is verified for some permutation snarks including an infinite family of cyclically $5$-edge connected snarks constructed by J. H\"{a}gglund and A. Hoffmann-Ostenhof. This is a joint work with Siyan Liu, Cun-Quan Zhang and Zhang Zhang.

报告人简介：郝荣霞，北京交通大学教授, 博士生导师。主要从事图论和网络的研究，在IEEE Trans. Comput.、IEEE Trans. Parallel and Distribut. Systems、Inform. Sci.、European J. Combin.、J. Graph Theory等国内外学术期刊上发表SCI论文90余篇。主持和参加国家自然科学基金面上项目多项。参加国家自然科学基金重点项目一项。曾获北京运筹学会青年优秀论文一等奖，北京交通大学“巾帼十杰”、“毕业生我最敬爱的教师”、“教学名师”和“智瑾奖教金优秀教师奖”等奖项，主编教材两本。中国运筹学会图论组合分会第五届理事。国际期刊International Journal of Computer Mathematics: Computer Systems Theory 的编委。