Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles

Author	dc.contributor.author	Román Bustamante, Sebastián Kamal
Author	dc.contributor.author	Hàn, Hiệp
Author	dc.contributor.author	Stein, Maya
Admission date	dc.date.accessioned	2019-05-29T13:38:53Z
Available date	dc.date.available	2019-05-29T13:38:53Z
Publication date	dc.date.issued	2017
Cita de ítem	dc.identifier.citation	Electronic Notes in Discrete Mathematics 61 (2017) 185–190
Identifier	dc.identifier.issn	15710653
Identifier	dc.identifier.other	10.1016/j.endm.2017.06.037
Identifier	dc.identifier.uri	https://repositorio.uchile.cl/handle/2250/168977
Abstract	dc.description.abstract	We show that any 2-colouring of the 3-uniform complete hypergraph Kn (3) on n vertices contains two disjoint monochromatic tight cycles of distinct colours covering all but o(n) vertices of Kn (3). The same result holds if we replace tight cycles with loose cycles.
Lenguage	dc.language.iso	en
Publisher	dc.publisher	Elsevier B.V.
Type of license	dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Chile
Link to License	dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/cl/
Source	dc.source	Electronic Notes in Discrete Mathematics
Keywords	dc.subject	Monochromatic cycle partitioning
Keywords	dc.subject	Tight cycles
Título	dc.title	Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
Document type	dc.type	Artículo de revista
Cataloguer	uchile.catalogador	laj
Indexation	uchile.index	Artículo de publicación SCOPUS
uchile.cosecha	uchile.cosecha	SI

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