Cover \(k\)-uniform hypergraphs by monochromatic loose paths

zbMath1373.05067MaRDI QIDQ2411510

Yanyan Li

Publication date: 24 October 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i4p23

zbMATH Keywords

hypergraphmonochromatic loose path

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Vertex covers by monochromatic pieces -- a survey of results and problems
• Ramsey numbers of 3-uniform loose paths and loose cycles
• Improved monochromatic loose cycle partitions in hypergraphs
• Monochromatic loose-cycle partitions in hypergraphs
• The Ramsey number of loose triangles and quadrangles in hypergraphs
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
• Monochromatic path and cycle partitions in hypergraphs
• Monochromatic loose path partitions in \(k\)-uniform hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Monochromatic components in edge-colored complete uniform hypergraphs
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Vertex coverings by monochromatic paths and cycles
• Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas