On multipartite posets
From MaRDI portal
Abstract: A poset is {em -partite} if has a partition such that (1) each forms an antichain in , and (2) implies and where . In this article we derive a tight asymptotic upper bound on the order dimension of -partite posets in terms of 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- On retractable sets and the fixed point property
- On the order dimension of convex polytopes
- Partially Ordered Sets
- The Complexity of the Partial Order Dimension Problem
- The dimension of interior levels of the Boolean lattice
- The Order Dimension of Convex Polytopes
- The order dimension of the complete graph
- The order dimension of two levels of the Boolean lattices
Cited in
(7)- The numbers of shared upper bounds determine a poset
- Semi-pointed partition posets
- Positive Dependence, Upper Sets, and Multidimensional Partitions
- scientific article; zbMATH DE number 3995740 (Why is no real title available?)
- On \(n\)-normal posets
- A bipartite analogue of Dilworth's theorem
- Partitioning 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)