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 - N-connected - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2013-08-01 11:13:06 Open Document File Size: 258,70 KB Share Result on Facebook

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 witAdd to Reading List