On the number of \(C_ 5's\) in a triangle-free graph
The author proves that the number of 5-cycles in a triangle-free graph of order n does not exceed \(c((n+1)/5)^ 5\) where \(c<1.03\). P. Erdős has conjectured bound \((n/5)^ 5\).
scientific article; zbMATH DE number 4112630
scientific article