A set of elements of P is called an antichain if no two distinct elements of the set are comparable. An antichain is maximal if it is not properly contained in any other antichain of P.
i1 : maximalAntichains divisorPoset 30 o1 = {{1}, {30}, {2, 15}, {3, 10}, {5, 6}, {2, 3, 5}, {6, 10, 15}} o1 : List |