On multipartite posets
| dc.creator | Agnarsson, Geir | |
| dc.date | 2007-06-11 | |
| dc.date.accessioned | 2026-07-07T08:04:57Z | |
| dc.date.available | 2026-07-07T08:04:57Z | |
| dc.description | A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ 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. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/0706.1529 | |
| dc.identifier | http://arxiv.org/abs/0706.1529 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130152 | |
| dc.subject | Combinatorics | |
| dc.subject | 06A07 | |
| dc.title | On multipartite posets | |
| dc.type | text |