Monochromatic loose path partitions in \(k\)-uniform hypergraphs

DOI10.1016/j.disc.2017.08.018zbMath1370.05171arXiv1611.03259OpenAlexW2573875106MaRDI QIDQ2404368

Yanyan Li

Publication date: 18 September 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

partitioncolored complete uniform hypergraphsmonochromatic loose path

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Cover \(k\)-uniform hypergraphs by monochromatic loose paths ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles

Cites Work

• Unnamed Item
• Vertex covers by monochromatic pieces -- a survey of results and problems
• Improved monochromatic loose cycle partitions in hypergraphs
• Monochromatic loose-cycle partitions in hypergraphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Monochromatic path and cycle partitions in hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas

This page was built for publication: Monochromatic loose path partitions in \(k\)-uniform hypergraphs