The maximum number of triangles in a graph of given maximum degree
The maximum number of triangles in a graph of given maximum degree
Maximizing or minimizing the number of copies of a fixed graph in a large host graph is one of the most classical topics in extremal graph theory. Indeed, one of the most famous problems in extremal graph theory, the Erdős-Rademacher problem, which can be traced back to the 1940s, asks …