On the least size of a graph with a given degree set -- II

Jai Moondra, Aditya Sahdev, Amitabha Tripathi

The degree set of a finite simple graph $G$ is the set of distinct degrees of vertices of $G$. A theorem of Kapoor, Polimeni & Wall asserts that the least order of a graph with a g…