Multicolored subsets in colored hypergraphs

DOI10.1006/jcta.1996.0049zbMath0853.05058OpenAlexW1987432133MaRDI QIDQ1914009

Hanno Lefmann, Beata Wysocka, Vojtěch Rödl

Publication date: 9 July 1996

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

Full work available at URL: https://doi.org/10.1006/jcta.1996.0049

zbMATH Keywords

hypergraphcoloringanti-Ramesy type problems

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (7)

Polychromatic cliques ⋮ Rainbow Ramsey simple structures ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ An algorithmic framework for obtaining lower bounds for random Ramsey problems ⋮ Anti-Ramsey properties of random graphs ⋮ On the independence number of non-uniform uncrowded hypergraphs

This page was built for publication: Multicolored subsets in colored hypergraphs