Highly connected multicoloured subgraphs of multicoloured graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 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.
38 pgs, no figures, submitted Feb 2006

Keywords

Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/123906

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0702369
 http://arxiv.org/abs/math/0702369

Collections

arXiv