Highly connected monochromatic subgraphs of multicoloured graphs

Simple item page
dc.creatorLiu, Henry
dc.creatorMorris, Robert
dc.creatorPrince, Noah
dc.date2007-02-13
dc.date.accessioned2026-07-07T07:46:40Z
dc.date.available2026-07-07T07:46:40Z
dc.descriptionWe 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.
dc.description25 pgs, 3 figures, to appear in Journal of Graph Theory
dc.identifierhttps://arxiv.org/abs/math/0702354
dc.identifierhttp://arxiv.org/abs/math/0702354
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123900
dc.subjectCombinatorics
dc.titleHighly connected monochromatic subgraphs of multicoloured graphs
dc.typetext

Files

Collections

arXiv