On a problem of Erdős about graphs whose size is the Turán number plus one

Pu Qiao, Xingzhi Zhan

We consider finite simple graphs. Given a graph $H$ and a positive integer $n,$ the Turán number of $H$ for the order $n,$ denoted $\mathrm{ex}(n,H),$ is the maximum size of a graph o…