antichain
A subset of a poset is an antichain if no two elements are comparable. That is, if then and .
A maximal antichain of is one which is maximal.
In particular, if is a tree then the maximal antichains are exactly those antichains which intersect every branch, and if the tree is splitting then every level is a maximal antichain.