The number of edges in graphs with bounded clique number and circumference

Chunyang Dou, Bo Ning, Xing Peng

Let $\mathcal{H}$ be a family of graphs. The Turán number $\mathrm{ex}(n,\mathcal{H})$ is the maximum possible number of edges in an $n$-vertex graph which does not contain any member of $\ca…