Highly connected multicoloured 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.descriptionSuppose 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 colours? This question is due to Bollobas, and the case s = 1 was considered in a preivous paper by the same authors. Here we consider the case s >= 2, and mention some open problems.
dc.description38 pgs, no figures, submitted Feb 2006
dc.identifierhttps://arxiv.org/abs/math/0702369
dc.identifierhttp://arxiv.org/abs/math/0702369
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123906
dc.subjectCombinatorics
dc.titleHighly connected multicoloured subgraphs of multicoloured graphs
dc.typetext

Files

Collections

arXiv