Large monochromatic components in colorings of complete 3-uniform hypergraphs
From MaRDI portal
Publication:1025935
DOI10.1016/J.DISC.2008.09.004zbMATH Open1177.05039OpenAlexW2012395017MaRDI QIDQ1025935FDOQ1025935
Authors: András Gyárfás, Penny 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
Recommendations
- Edge coloring complete uniform hypergraphs with many components
- Monochromatic components in edge-colored complete uniform hypergraphs
- Monochromatic components in edge-colored complete uniform hypergraphs
- Large monochromatic components in 3-colored non-complete graphs
- Large monochromatic components and long monochromatic cycles in random hypergraphs
Cites Work
Cited In (13)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems
- Large almost monochromatic subsets in hypergraphs
- Large monochromatic components in hypergraphs with large minimum codegree
- Large monochromatic components and long monochromatic cycles in random hypergraphs
- Edge coloring complete uniform hypergraphs with many components
- Large monochromatic components in expansive hypergraphs
- Thermodynamic geodesics of a Reissner Nordström black hole
- Large monochromatic components in 3-colored non-complete graphs
- Monochromatic components in edge-colored complete uniform hypergraphs
- Coloring triple systems with local conditions
- Large 2-coloured matchings in 3-coloured complete hypergraphs
- Ramsey problems for Berge hypergraphs
- Large monochromatic components in colorings of complete hypergraphs
This page was built for publication: Large monochromatic components in colorings of complete 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025935)