Universität zu Köln

Lang, Richard, Schaudt, Oliver and Stein, Maya (2017). ALMOST PARTITIONING A 3-EDGE-COLORED Kn,n INTO FIVE MONOCHROMATIC CYCLES. SIAM Discret. Math., 31 (2). S. 1374 - 1403. PHILADELPHIA: SIAM PUBLICATIONS. ISSN 1095-7146

Full text not available from this repository.

Abstract

We show that for any coloring of the edges of the complete bipartite graph K-n,K-n with three colors there are five disjoint monochromatic cycles which together cover all but o(n) of the vertices. In the same situation, 18 disjoint monochromatic cycles together cover all vertices.

Item Type:	Journal Article
Creators:	Creators Email ORCID ORCID Put Code Lang, Richard UNSPECIFIED UNSPECIFIED UNSPECIFIED Schaudt, Oliver UNSPECIFIED UNSPECIFIED UNSPECIFIED Stein, Maya UNSPECIFIED UNSPECIFIED UNSPECIFIED
URN:	urn:nbn:de:hbz:38-245907
DOI:	10.1137/15M104222X
Journal or Publication Title:	SIAM Discret. Math.
Volume:	31
Number:	2
Page Range:	S. 1374 - 1403
Date:	2017
Publisher:	SIAM PUBLICATIONS
Place of Publication:	PHILADELPHIA
ISSN:	1095-7146
Language:	English
Faculty:	Unspecified
Divisions:	Unspecified
Subjects:	no entry
Uncontrolled Keywords:	Keywords Language COMPLETE BIPARTITE GRAPHS; VERTEX COVERINGS; PATHS Multiple languages Mathematics, Applied Multiple languages
Refereed:	Yes
URI:	http://kups.ub.uni-koeln.de/id/eprint/24590