Non-r-partite graphs without complete split subgraphs

Bing Wang, Wenwen Chen, Ping Zhang

The classical Simonovits' chromatic critical edge theorem shows that for sufficiently large $n$, if $H$ is an edge-color-critical graph with $\ddot{I}‡(H)=p+1\ge 3$, then the Turán graph…