Weak-order extensions of an order

From MaRDI portal





The authors are interested in an algorithmic and structural study of extensions of a partially ordered set. At first they describe a graph representing all the weak-order extensions of a partially ordered set and an algorithm generating them. Further they present a one-to-one correspondence between all the weak-order extensions of an order and all the paths from the unique source to the unique sink of a certain graph. This result is related to a similar characterization of linear and minimal interval extensions. Finally they prove that the number of weak-order extensions of a partially ordered set is a comparability invariant whereas the number of minimal weak-order extensions of a partially ordered set is not a comparability invariant. For the entire collection see [Zbl 0877.00011].











This page was built for publication: Weak-order extensions of an order

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