A Ramsey Type problem for highly connected subgraphs

Chunlok Lo, Hehui Wu, Qiqin Xie

Bollobás and Gyárfás conjectured that for any $k,n\in {\mathbb{Z}}^{+}$ with $n>4(k-1)$, every 2-edge-coloring of the complete graph on $n$ vertices leads to a $k$-connected monoch…