Show simple item record

Authordc.contributor.authorLang, Richard 
Authordc.contributor.authorSchaudt, Oliver 
Authordc.contributor.authorStein, Maya 
Admission datedc.date.accessioned2019-05-29T13:30:02Z
Available datedc.date.available2019-05-29T13:30:02Z
Publication datedc.date.issued2017
Cita de ítemdc.identifier.citationSIAM Journal on Discrete Mathematics, Volumen 31, Issue 2, 2017, Pages 1374-1402
Identifierdc.identifier.issn08954801
Identifierdc.identifier.other10.1137/15M104222X
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/168896
Abstractdc.description.abstractWe show that for any coloring of the edges of the complete bipartite graph Kn,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.
Lenguagedc.language.isoen
Publisherdc.publisherSociety for Industrial and Applied Mathematics Publications
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
Sourcedc.sourceSIAM Journal on Discrete Mathematics
Keywordsdc.subjectComplete bipartite graph
Keywordsdc.subjectMonochromatic cycle partition
Keywordsdc.subjectRamsey-type problem
Títulodc.titleAlmost partitioning A 3-edge-colored Kn,n into five monochromatic cycles
Document typedc.typeArtículo de revista
Catalogueruchile.catalogadorlaj
Indexationuchile.indexArtículo de publicación SCOPUS
uchile.cosechauchile.cosechaSI


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile