科研之友
微信
新浪微博
Facebook
分享链接
摘要
We show that each 2-edge coloring of the complete graph on n vertices leads to a monochromatic k-connected subgraph on at least n - 2(k - 1) vertices, provided n >= 4k - 3. It settles in the affirmative a conjecture of Bollobas and Gyarfas.
- 出版日期2016-3
