Monochromatic components in edge-colored complete uniform hypergraphs

DOI10.1016/j.ejc.2013.06.040zbMath1292.05202OpenAlexW1981383663MaRDI QIDQ2509763

Zoltán Király

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.040

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Generalizations and strengthenings of Ryser's conjecture ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Covering complete partite hypergraphs by monochromatic components ⋮ Cover \(k\)-uniform hypergraphs by monochromatic loose paths ⋮ A note on covering edge colored hypergraphs by monochromatic components ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ Symbolic coloured SCC decomposition ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Ryser's conjecture for tripartite 3-graphs
• A comment on Ryser's conjecture for intersecting hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Hall's theorem for hypergraphs

This page was built for publication: Monochromatic components in edge-colored complete uniform hypergraphs