Ramsey partial orders from acyclic graphs
An \(RN\) graph \((X,R,N,\leq)\) consists of an acyclic graph \(X\), a linear order \(\leq\) on its vertices, and two relations \(R\), \(N\) on \(X\) which are disjoint and compatible with \(\leq\). We call an \(RN\) graph complete if for every distinct \(x,y \in X\) with \(x < y\), either \(xRy\) or \(xNy\). One can naturally extend an ordered poset to a complete \(RN\) graph. For \(\ell \geq 2\), a set of vertices \(x_1,x_2,\ldots,x_{\ell}\) of an \(RN\)-graph \((X,R,N,\leq)\) is called a bad quasicycle of length \(\ell\) if \(x_iRx_{i+1}\) for each \(i\) and \(x_1Nx_{\ell}\). An \(\ell\)-\(RN\) graph is an \(RN\) graph with no bad quasicycle of length less than or equal to \(\ell\). The main result of this paper is that given any two ordered posets \(A,B\), there is a sequence of \(RN\) graphs \(C_2,C_3,\ldots\) together with homomorphisms \(h_{\ell}:C_{\ell+1} \to C_{\ell}\), such that each \(C_{\ell}\) is an \(\ell\)-\(RN\) graph and however we finitely colour all copies of \(A\) in \(C_{\ell}\) there will be a copy of \(B\) in \(C_{\ell}\) such that all copies of \(A\) in \(B\) are of the same colour.
- A Ramsey theorem for partial orders with linear extensions
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- scientific article; zbMATH DE number 3902698 (Why is no real title available?)
- 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
- Note on a Ramsey theorem for posets with linear extensions
- Ramsey theorem for designs
- Ramsey properties of countably infinite partial orderings
- Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
- A Ramsey theorem for multiposets
- A Ramsey theorem for partial orders with linear extensions
- Big Ramsey degrees using parameter spaces
- Characterisation of the big Ramsey degrees of the generic partial order
- Finite presentation of homogeneous graphs, posets and Ramsey classes
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)
