Erdős–Tetali theorem

The Erdős–Tetali theorem is a result in combinatorial mathematics related to the study of extremal graph theory. Specifically, it deals with the relationship between the number of edges in a graph and the degrees of its vertices.