Bertet, KarellGustedt, JensMorvan, Michel2021-12-172021-12-1719972197-8085https://depositonce.tu-berlin.de/handle/11303/15672http://dx.doi.org/10.14279/depositonce-14445In 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.en510 Mathematikorderweak-order extensionsgraphalgorithmResearch Paper