Ramsey partial orders from acyclic graphs
From MaRDI portal
Abstract: We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.
Recommendations
Cites work
- scientific article; zbMATH DE number 3902698 (Why is no real title available?)
- A Ramsey theorem for partial orders with linear extensions
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- Models Without Indiscernibles
- Partitions of finite relational and set systems
- Ramsey Classes and Homogeneous Structures
- Ramsey classes of set systems
- Ramsey properties of finite posets
- Ramsey property, ultrametric spaces, finite posets, and universal minimal flows
- Symmetry and the Ramsey degree of posets
- The partite construction and Ramsey set systems
- Two proofs of the Ramsey property of the class of finite hypergraphs
Cited in
(7)- A Ramsey theorem for multiposets
- Finite presentation of homogeneous graphs, posets and Ramsey classes
- Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
- Ramsey properties of countably infinite partial orderings
- A Ramsey theorem for partial orders with linear extensions
- Note on a Ramsey theorem for posets with linear extensions
- Ramsey theorem for designs
This page was built for publication: Ramsey partial orders from acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722590)
