Highly connected multicoloured subgraphs of multicoloured graphs

Details Highly connected multicoloured subgraphs of multicoloured graphs Highly connected multicoloured subgraphs of multicoloured graphs

2007-02-13

arxiv.org/abs/math/0702369v1

Mathematics

Combinatorics

38 pgs, no figures, submitted Feb 2006

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Highly connected multicoloured subgraphs of multicoloured graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Highly connected multicoloured subgraphs of multicoloured graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Highly connected multicoloured subgraphs of multicoloured graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-409784