Universal and unavoidable graphs

Matija Bucić, Nemanja Draganić, Benny Sudakov

The Turán number $\text{ex}(n,H)$ of a graph $H$ is the maximal number of edges in an $H$-free graph on $n$ vertices. In $1983$ Chung and Erdős asked which graphs $H$ with $e$ edge…