 Odd-cycle copies from positive triangle density

For any fixed odd length $\ell \ge 3$, positive triangle in a graph density forces positive density of $\ell$-cycles. A Szemerédi regularity lemma partition retains a triangle in a graph of regular dense pairs after the sparse and exceptional pairs are removed. Count embeddings of a proper three-colouring of $C_{\ell }$ into those three clusters. The constants depend on $\beta$ and $\ell$, not on graph order.