Ramsey partial orders from acyclic graphs
From MaRDI portal
Publication:722590
DOI10.1007/S11083-017-9433-4zbMATH Open1419.05213arXiv1608.04662OpenAlexW2962965357MaRDI QIDQ722590FDOQ722590
Authors: J. Nešetřil, Vojtěch Rödl 
Publication date: 27 July 2018
Published in: Order (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1608.04662
Recommendations
Generalized Ramsey theory (05C55) Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10)
Cites Work
- Ramsey classes of set systems
- The partite construction and Ramsey set systems
- Partitions of finite relational and set systems
- Models Without Indiscernibles
- Ramsey properties of finite posets
- Ramsey Classes and Homogeneous Structures
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- Symmetry and the Ramsey degree of posets
- Ramsey property, ultrametric spaces, finite posets, and universal minimal flows
- A Ramsey theorem for partial orders with linear extensions
- Title not available (Why is that?)
- Two proofs of the Ramsey property of the class of finite hypergraphs
Cited In (7)
- A Ramsey theorem for multiposets
- Ramsey properties of countably infinite partial orderings
- Ramsey theorem for designs
- Finite presentation of homogeneous graphs, posets and Ramsey classes
- A Ramsey theorem for partial orders with linear extensions
- Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
- Note on a Ramsey theorem for posets with linear extensions
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)
