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

DOI10.1016/J.ENDM.2017.06.037MaRDI QIDQ1689909zbMATH OpenOpenAlexFDO

Authors Sebastián Bustamante, Hiệp Hàn, Maya 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

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

Recommendations

• Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
• Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles
• Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
• Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Almost partitioning a 3-edge-colored \(K_{n,n}\) into five monochromatic cycles

Cites work

• An improved bound for the monochromatic cycle partition number
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Improved monochromatic loose cycle partitions in hypergraphs
• On perfect matchings in uniform hypergraphs with large minimum vertex degree
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• The Ramsey number for 3-uniform tight hypergraph cycles
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)

Cited in

(5)

• Towards Lehel's conjecture for 4-uniform tight cycles
• Monochromatic paths in 2-edge-coloured graphs and hypergraphs
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles
• Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
• Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689909)