Small dense subgraphs of a graph

Tao Jiang, Andrew Newman

Given a family $\mathcal{F}$ of graphs, and a positive integer $n$, the Turán number $ex(n,\mathcal{F})$ of $\mathcal{F}$ is the maximum number of edges in an $n$-vertex graph that does not…