科研之友
微信
新浪微博
Facebook
分享链接
摘要
Bollobas and Gyarfas conjectured that for n > 4 (k - 1) every 2-edge-coloring of K (n) contains a monochromatic k-connected subgraph with at least n - 2k + 2 vertices. Liu, et al. proved that the conjecture holds when n a parts per thousand yen 13k - 15. In this note, we characterize all the 2-edge-colorings of K (n) where each monochromatic k-connected subgraph has at most n-2k+2 vertices for n a parts per thousand yen 13k - 15.
- 出版日期2014-6
- 单位浙江师范大学
