3 citations · 3 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2007
Highly connected multicoloured subgraphs of multicoloured graphs
Henry Liu, Robert Morris, Noah Prince
Suppose the edges of the complete graph on n vertices are coloured using r colours; how large a k-connected subgraph are we guaranteed to find, which uses only at most s of the col…
math.CO2007★ 3 cited
Highly connected monochromatic subgraphs of multicoloured graphs
Henry Liu, Robert Morris, Noah Prince
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 c…