A set of elements of $P$ is called an antichain if no two distinct elements of the set are comparable.
|
|
With the input k, the method restricts to only antichains of that length. In a divisorPoset, all chains of length $2$ describe exactly the non-divisor-multiple pairs.
|
Since every distinct pair of vertices in a chain is comparable, the only antichains of a chain are the singleton sets and the empty set.
|
The object antichains is a method function.