On multipartite posets

Abstract: A poset

m a t h b f P = (X, p r e c e q)

is {em

m

-partite} if

X

has a partition

X = X_{1} c u p ... c u p X_{m}

such that (1) each

X_{i}

forms an antichain in

m a t h b f P

, and (2)

x p r e c y

implies

x i n X_{i}

and

y i n 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.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: On multipartite posets