Sanming Zhou

The exact Tur\'{a}n number of the even wheel $W_{2k+2}$ among non-$3$-partite graphs

Let $\mathrm{ex}(n,H)$ denote the Tur\'{a}n number of $H$. A graph is color-critical if there exists an edge $e\in E(H)$ such that $\chi(H-e)<\chi(H)$. For a color-critical graph $H$ with $\chi(H)=r+1$, Simonovits'chromatic critical edge theorem implies that there exists an $n_0(H)$ such that $\mathrm{ex}(n,H)=e(T_{n,r...