BIPARTITIONS OF HIGHLY CONNECTED TOURNAMENTS ¨ JAEHOON KIM, DANIELA KUHN, DERYK OSTHUS Abstract. We show that if T is a strongly 109 k6 log(2k)-connected tournament, there exists a partition A, B of V (T ) such that eac - K6 - Document - PDFSEARCH.IO

First Page	Meta Content
	BIPARTITIONS OF HIGHLY CONNECTED TOURNAMENTS ¨ JAEHOON KIM, DANIELA KUHN, DERYK OSTHUS Abstract. We show that if T is a strongly 109 k6 log(2k)-connected tournament, there exists a partition A, B of V (T ) such that eac Add to Reading List Document Date: 2016-01-27 02:15:42 Open Document File Size: 401,93 KB Share Result on Facebook

BIPARTITIONS OF HIGHLY CONNECTED TOURNAMENTS ¨ JAEHOON KIM, DANIELA KUHN, DERYK OSTHUS Abstract. We show that if T is a strongly 109 k6 log(2k)-connected tournament, there exists a partition A, B of V (T ) such that eacAdd to Reading List