Counting triangles in graphs with no wheels of order at least five

Chunyang Dou, Bo Ning, Xing Peng

For a family of graphs $\mathcal{F}$, a graph $G$ is said to be $\mathcal{F}$-free if it contains no member of $\mathcal{F}$ as a subgraph. A wheel graph $W_k$ is a graph on $k+1$ ver…