1 paper
Louigi Addario-Berry, Bruce Reed, Dao Chen Yuan
An n-tuple D=(d(1),…,d(n)) is a \emph{feasible degree sequence} if there is a graph on {1,…,n} such that i has degree d(i). Any such graph will have $m=\sum_{i=…