报告主题：对一些snarks的Berge-Fulkerson的猜想（The Berge-Fulkerson conjecture for some snarks ）
报 告 人：郝荣霞 教授（北京交通大学）
报告时间：2021年5月13日（周四） 16:30
参会方式：腾讯会议
会议ID：926 390 254
邀请人：康丽英
报告摘要：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.