圖與組合系列講座之四十九(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

 

 


返回原圖
/