Two proofs of the Ramsey property of the class of finite hypergraphs
From MaRDI portal
(Redirected from Publication:1835932)
Cites work
- scientific article; zbMATH DE number 3675949 (Why is no real title available?)
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 3470438 (Why is no real title available?)
- scientific article; zbMATH DE number 3536154 (Why is no real title available?)
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- Models Without Indiscernibles
- Partitions of finite relational and set systems
- Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
- Regularity and Positional Games
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
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)
