Two proofs of the Ramsey property of the class of finite hypergraphs

zbMath0505.05047MaRDI QIDQ1835932

Jaroslav Nešetřil, Vojtěch Rödl

Publication date: 1982

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

uniform hypergraphcoloring hyperedgesmonochromatic subhypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items (6)

Induced restricted Ramsey theorems for spaces ⋮ Local \(k\)-colorings of graphs and hypergraphs ⋮ A Ramsey class for Steiner systems ⋮ On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property ⋮ Ramsey partial orders from acyclic graphs ⋮ All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
• Partitions of finite relational and set systems
• Regularity and Positional Games
• Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
• Models Without Indiscernibles
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring

This page was built for publication: Two proofs of the Ramsey property of the class of finite hypergraphs