On multipartite posets

From MaRDI portal



Abstract: A poset mathbfP=(X,preceq) is {em m-partite} if X has a partition X=X1cup...cupXm such that (1) each Xi forms an antichain in mathbfP, and (2) xprecy implies xinXi and yinXj where i<j. In this article we derive a tight asymptotic upper bound on the order dimension of m-partite posets in terms of m and their bipartite sub-posets in a constructive and elementary way.


A poset \(P=(X,\leq )\) is called \(m\)-bipartite (\(m\geq 2\)) if \(X\) is a partition \(X=X_1\cup \dots\cup X_m\) such that \(X_i\) is an antichain in \(P\) and \(x<y\) implies \(x\in X_i\) and \(y\in X_j\), where \(i<j\). This notion is a generalization of that of a bipartite poset. The author derives a tight asymptotic upper bound on the order dimension of \(m\)-partite posets.











This page was built for publication: On multipartite posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519843)