Size of the Largest Antichain in a Partition Poset

Partitions $\{(k_1,K_{\ell})\}$ of a given set are considered as a partially ordered set (poset) with a natural partial ordering with respect to inclusion. Asymptotics for the size of the largest antichain in this poset is found for $\ell$ fixed.