A bound on the inducibility of cycles

In 1975, Pippenger and Golumbic conjectured that every n-vertex graph has at most nk/(kk−k) induced cycles of length k≥5. We prove that every n-vertex graph has at most 2nk/kk induced cycles of length k.