A short proof of a theorem on degree sets of graphs
For a finite simple graph G, we denote the set of degrees of its vertices, known as its degree set , by D(G) D ( G ) . Kapoor, Polimeni and Wall [Degree sets for graphs, Fund. Math. 95 (1977) 189194] have determined the least number of vertices among graphs with a given degree set. We give a very short proof of this result.
degree sets degree sequences