Loading…
Weak-Order Extensions of an Order
Bertet, Karell; Gustedt, Jens; Morvan, Michel
Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
In this paper, at first we describe a graph representing all the weak-order extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weak-order extensions of a partially ordered set, and implying a generation algorithm. Finally, we 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.
