Rational exponents in extremal graph theory (Q1644492)

Given a family of graphs \(\mathcal{H}\), another graph \(G\) is said to be \(\mathcal{H}\)-free if it contains no graph from the family \(\mathcal{H}\) as a subgraph. The extremal number \(\operatorname{ex}(n,\mathcal{H})\) is then defined to be the largest number of edges in an \(\mathcal{H}\)-free graph on \(n\) vertices. The first estimate for this function given by Erdős-Stone-Simonovits. The authors in this paper proved that for every rational number \(r\) between \(1\) and \(2\), there is a family of graphs \(\mathcal{H}_r\) such that \(\operatorname{ex}(n,\mathcal{H}_r) = \theta(n^r)\).