科研之友
微信
新浪微博
Facebook
分享链接
摘要
We prove chi'(s) (G) <= 1.93 Delta(G)(2) for graphs of sufficiently large maximum degree where chi'(s) (G) is the strong chromatic index of G. This improves an old bound of Molloy and Reed. As a by-product, we present a Talagrand-type inequality where we are allowed to exclude unlikely bad outcomes that would otherwise render the inequality unusable.
- 出版日期2018-1
