图与组合系列讲座之四十九(Willem H. Haemers教授)

发布时间:2019-08-16作者:访问量:10

报告题目:The chromatic index of strongly regular graphs

报告人:Willem H. Haemers 教授(荷兰Tiburg大学)

报告时间:2019826日(周一)上午11:00-12:00

报告地点:磬苑校区数学楼H306报告厅

报告摘要:It follows from Vizing’s theorem that the chromatic index (edge chromatic number) of a k- regular graph equals k or k + 1, and that it equals k + 1 if the graph has odd order. We investigate the chromatic index of strongly regular graphs (SRGs) of even order. It turns out that, except for the Petersen graph, all investigated connected SRGs of even order have chromatic index equal to the degree, and we conjecture that this is the case for all connected SRGs of even order.

Joint work with Sebastian M. Cioab\u{a} and Krystal Guo.

欢迎各位老师、同学届时前往!

 

科学技术处

                                        2019816

 

 


返回原图
/