HIGHLY CONNECTED COLOURED SUBGRAPHS VIA THE REGULARITY LEMMA HENRY LIU1 AND YURY PERSON2 Abstract. For integers n, r, s, k ∈ N, n ≥ k and r ≥ s, let m(n, r, s, k) be the largest (in order) k-connected component wit

First Page		Document Content
Date: 2013-08-01 11:13:06		HIGHLY CONNECTED COLOURED SUBGRAPHS VIA THE REGULARITY LEMMA HENRY LIU1 AND YURY PERSON2 Abstract. For integers n, r, s, k ∈ N, n ≥ k and r ≥ s, let m(n, r, s, k) be the largest (in order) k-connected component wit Add to Reading List Source URL: www.math.uni-frankfurt.de Download Document from Source Website File Size: 258,70 KB Share Document on Facebook