Large monochromatic components in hypergraphs with large minimum codegree

DOI10.1002/JGT.23044arXiv2301.05806MaRDI QIDQ6144911

Louis DeBiasio, Deepak Bal

Publication date: 30 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryhypergraphsmonochromatic components

Mathematics Subject Classification ID

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

Cites Work

• Large monochromatic components in 3-colored non-complete graphs
• Large monochromatic components in colorings of complete 3-uniform hypergraphs
• Covering \(t\)-element sets by partitions
• Large monochromatic components in almost complete graphs and bipartite graphs
• Monochromatic components in edge-coloured graphs with large minimum degree
• Large monochromatic components in edge colored graphs with a minimum degree condition
• Large monochromatic components in multicolored bipartite graphs

This page was built for publication: Large monochromatic components in hypergraphs with large minimum codegree