We derive a combinatorial criterion for detecting k-separability of N-partite
Dicke states. The criterion is efficiently computable and implementable without
full state tomography. We give examples in which the criterion succeeds, where
known criteria fail
