2007/02/13 by Henry Liu, Robert Morris, Liu, Henry +3 · 1 citation
Mathematics · #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.math/0702354
We consider the following question of Bollobas: given an r-colouring of the edges of the complete graph on n vertices, how large a k-connected subgraph can we find using only one colour? We solve this problem asymptotically when r-1 is a prime power, and exactly for 2- and 3-colourings.