Highly connected multicoloured subgraphs of multicoloured graphs
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0702369,
title = {Highly connected multicoloured subgraphs of multicoloured graphs},
author = {Henry Liu and Robert Morris and Noah Prince},
journal= {arXiv preprint arXiv:math/0702369},
year = {2007}
}
备注
38 pgs, no figures, submitted Feb 2006