Ramsey partial orders from acyclic graphs (Q722590)

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.