1 research outputs found
Monochromatic -connected Subgraphs in 2-edge-colored Complete Graphs
Bollob\'{a}s and Gy\'{a}rf\'{a}s conjectured that for any with , every 2-edge-coloring of the complete graph on
vertices leads to a -connected monochromatic subgraph with at least
vertices. We find a counterexample with , thus disproving the conjecture, and we show the
conjecture is true for