Turán number of books in non-bipartite graphs

Lu Miao, Ruifang Liu, Edwin R. van Dam

Let $\mathrm{ex}(n,H)$ be the Turán number of $H$ for a given graph $H$. A graph is color-critical if it contains an edge whose removal reduces its chromatic number. Simonovits' c…