Highly connected monochromatic subgraphs of multicoloured graphs
classification
🧮 math.CO
keywords
asymptoticallybollobascolourcolouringscompleteconnectedconsideredges
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.