Paper Info
Title
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles.
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.
Year
DOI
Venue
2017
10.1016/j.endm.2017.06.037
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
Monochromatic cycle partitioning,tight cycles
Discrete mathematics,Combinatorics,Monochromatic color,Disjoint sets,Vertex (geometry),Hypergraph,Constraint graph,Mathematics
Journal
Volume
ISSN
Citations 
61
1571-0653
0
PageRank 
References 
Authors
0.34
5
3
Name
Order
Citations
PageRank
Sebastián Bustamante102.03
Hiêp Hàn2398.07
maya stein38115.65