Non-r-partite graphs without complete split subgraphs

Abstract: The classical Simonovits' chromatic critical edge theorem shows that for sufficiently large $n$, if $H$ is an edge-color-critical graph with $\chi(H)=p+1\ge 3$, then the Tur\'an graph $T_{n,p}$ is the unique extremal graph with respect to ${\rm ex}(n,H)$. Denote by ${\rm EX}{r+1}(n,H)$ and ${\rm SPEX}{r+1}(n,H)$ the family of $n$-vertex $H$-free non-$r$-partite graphs with the maximum size and with the spectral radius, respectively. Li and Peng [SIAM J. Discrete Math. 37 (2023) 2462--2485] characterized the unique graph in $\mathrm{SPEX}{r+1}(n,K{r+1})$ for $r\geq 2$ and showed that $\mathrm{SPEX}{r+1}(n,K{r+1})\subseteq \mathrm{EX}{r+1}(n,K{r+1})$. It is interesting to study the extremal or spectral extremal problems for color-critical graph $H$ in non-$r$-partite graphs. For $p\geq 2$ and $q\geq 1$, we call the graph $B_{p,q}:=K_p\nabla qK_1$ a complete split graph (or generalized book graph). In this note, we determine the unique spectral extremal graph in $\mathrm{SPEX}{r+1}(n,B{p,q})$ and show that $\mathrm{SPEX}{r+1}(n,B{p,q})\subseteq \mathrm{EX}{r+1}(n,B{p,q})$ for sufficiently large $n$.