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

DOI10.1016/j.endm.2017.06.037zbMath1378.05048OpenAlexW2742418291MaRDI QIDQ1689909

Hiệp Hàn, Sebastián Bustamante, Maya Jakobine Stein

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.037

zbMATH Keywords

tight cyclesmonochromatic cycle partitioning

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles

Cites Work

• Improved monochromatic loose cycle partitions in hypergraphs
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• An improved bound for the monochromatic cycle partition number
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

This page was built for publication: Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles