# Anti-chain

A set $A$ of elements of a partially ordered set $(S,\le)$ which are incomparable: for $x \neq y$ in $A$, neither $x \le y$ nor $y \le x$ holds. The width of a partially ordered set is the the largest size of an antichain.