Large monochromatic components in colorings of complete 3-uniform hypergraphs

DOI10.1016/j.disc.2008.09.004zbMath1177.05039OpenAlexW2012395017MaRDI QIDQ1025935

András Gyárfás, Penny E. Haxell

Publication date: 23 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.004

zbMATH Keywords

monochromatic componentshypergraph edge coloring

Mathematics Subject Classification ID

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

Related Items (6)

Large monochromatic components and long monochromatic cycles in random hypergraphs ⋮ Large monochromatic components in colorings of complete hypergraphs ⋮ Large monochromatic components in hypergraphs with large minimum codegree ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Thermodynamic geodesics of a Reissner Nordström black hole ⋮ Ramsey Problems for Berge Hypergraphs

Cites Work

• Maximum degree and fractional matchings in uniform hypergraphs
• Covering \(t\)-element sets by partitions
• Unnamed Item

This page was built for publication: Large monochromatic components in colorings of complete 3-uniform hypergraphs