A note on covering edge colored hypergraphs by monochromatic components

zbMath1300.05096MaRDI QIDQ405234

Shinya Fujita, Ágnes Tóth, Michitaka Furuya, András Gyárfás

Publication date: 4 September 2014

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/v21i2p33

zbMATH Keywords

edge-coloringmonochromatic component

Mathematics Subject Classification ID

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

Related Items (2)

Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Covering complete partite hypergraphs by monochromatic components

Cites Work

• Unnamed Item
• Ryser's conjecture for tripartite 3-graphs
• Vertex coverings by monochromatic cycles and trees
• Monochromatic components in edge-colored complete uniform hypergraphs

This page was built for publication: A note on covering edge colored hypergraphs by monochromatic components