Large monochromatic components in colorings of complete hypergraphs

DOI10.1016/j.jcta.2024.105867arXiv2302.04487OpenAlexW4391431167MaRDI QIDQ6126163

Lyuben Lichev, Sammy Luo

Publication date: 9 April 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

coloringcombinatorial designstight componentcomplete hypergraphblow-up construction

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Partitioning random graphs into monochromatic components
• Asymptotic behavior of the chromatic index for hypergraphs
• Large monochromatic components in colorings of complete 3-uniform hypergraphs
• Covering \(t\)-element sets by partitions
• Large monochromatic components and long monochromatic cycles in random hypergraphs
• Forcing large tight components in 3-graphs
• Large monochromatic components in edge colored graphs with a minimum degree condition
• Large components in r-edge-colorings of Kn have diameter at most five
• Large monochromatic components in multicolored bipartite graphs
• Covering random graphs with monochromatic trees
• Monochromatic components with many edges
• Ramsey numbers of trails and circuits
• Minimum degree conditions for tight Hamilton cycles
• On Connected Components with Many Edges
• Large monochromatic components in 3‐edge‐colored Steiner triple systems

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