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

dc.creator	Román Bustamante, Sebastián Kamal
dc.creator	Hàn, Hiệp
dc.creator	Stein, Maya
dc.date.accessioned	2019-05-29T13:38:53Z
dc.date.available	2019-05-29T13:38:53Z
dc.date.created	2019-05-29T13:38:53Z
dc.date.issued	2017
dc.identifier	Electronic Notes in Discrete Mathematics 61 (2017) 185–190
dc.identifier	15710653
dc.identifier	10.1016/j.endm.2017.06.037
dc.identifier	https://repositorio.uchile.cl/handle/2250/168977
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.
dc.language	en
dc.publisher	Elsevier B.V.
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/cl/
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Chile
dc.source	Electronic Notes in Discrete Mathematics
dc.subject	Monochromatic cycle partitioning
dc.subject	Tight cycles
dc.title	Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
dc.type	Artículo de revista