Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles

DOI10.1002/jgt.22417zbMath1414.05205arXiv1701.07806OpenAlexW2901376529WikidataQ128987552 ScholiaQ128987552MaRDI QIDQ5379835

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

Publication date: 14 June 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.07806

zbMATH Keywords

hypergraphtight cycleloose cyclemonochromatic partitions

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Monochromatic square-cycle and square-path partitions ⋮ Towards Lehel's conjecture for 4-uniform tight cycles

This page was built for publication: Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles