A bound on the inducibility of cycles

Abstract

In 1975, Pippenger and Golumbic conjectured that every n-vertex graph has at most $n^k/(k^k-k)$ induced cycles of length k for k at least 5. We prove that every n-vertex graph has at most $2n^k/k^k$ induced cycles of length k.