Triangle-free graphs with the maximum number of cycles

Abstract

It is shown that for $n\ge 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.