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

zbMATH Open0505.05047MaRDI QIDQ1835932FDOQ1835932

Authors: J. 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

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

Cites Work

• Partitions of finite relational and set systems
• Models Without Indiscernibles
• Regularity and Positional Games
• Title not available (Why is that?)
• Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
• Title not available (Why is that?)
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs

Cited In (7)

• 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)
• A note on the induced Ramsey theorem for spaces
• Local \(k\)-colorings of graphs and hypergraphs
• Induced restricted Ramsey theorems for spaces
• A Ramsey class for Steiner systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835932)