  It is shown that for $n\geq 141$, among all triangle-free graphs on $n$
vertices, the complete equibipartite graph is the unique triangle-free graph
with the greatest number of cycles.

Combinatorics