A relation a < b of elements in P is a covering relation if there exists no c in P such that a < c < b. The set of covering relations is the minimal list of relations in P that describes all relations of P.
i1 : coveringRelations divisorPoset 12 o1 = {{1, 2}, {1, 3}, {2, 4}, {2, 6}, {3, 6}, {4, 12}, {6, 12}} o1 : List |