Chain lengths in the dominance lattice

We construct the largest union of two or three chains in the lattice of partitions of n under the dominance order. This construction provides a framework for finding the largest union of four or more chains. We also see how these chain lengths relate to a theorem of Gansner and Saks and the problem of finding the largest antichain.