Erdős–Gallai theorem

The Erdős–Gallai theorem is a fundamental result in graph theory that pertains to the characterization of graphs with a given number of edges. Specifically, it provides a criterion for deciding whether a graph can exist with a specified number of edges and vertices, while also satisfying certain degree conditions.