Independent sets into which all the vertices of the graph can be split
This is Mirsky's theorem, a sort of dual of Dilworth's theorem. Dilworth's theorem is a standard result in the combinatorics of posets.