Degree sets of degree uniform graphs (Q1068111)

A graph G is n-degree uniform if for every nonnegative integer r, there are either no vertices of degree r or n vertices of degree r. For any integer \(n\geq 2\), a necessary and sufficient condition for a (finite, nonempty) set of positive integers to be the degree set of an n-degree uniform graph is given.