吴文俊数学重点实验室组合图论系列讲座之三十三【Rong Luo】

发布者:系统管理员发布时间:2013-12-13浏览次数:18

题  目:Vizing's 2-factor conjecture on edge chromatic critical graphs


报告人:Rong  Luo       美国西弗吉尼亚大学

     
时   间:2013年12月17日    下午4:30--5:30

地   点:东区管理科研楼 365英国上市官网1611会议室

摘   要:
Vizing conjectured in 1960s that every edge chromatic critical graph has a 2--factor, a 2-regular spanning subgraph. There are not many results on this conjecture. In this talk I will present a new result on this conjecture, namely very critical graph with  large maximum degree has a hamiltonian cycle and this has a 2-factor. I will mention several other conjectures on edge coloring proposes by Vizing in late 1960s.
This is joint work with Zhengke Miao and Yue Zhao.

 


主办单位: 365英国上市官网 
                    中科院吴文俊数学重点实验室
 
欢迎广大师生参加!

Baidu
sogou