Rational exponents near 3/2
Given a graph $H$, the extremal number $ex(n,H)$ is the maximum number of edges in an $n$-vertex graph not containing $H$ as a subgraph. The well-known rational exponents conjecture of Erd\H{o}s and Simonovits states that for any rational $\gamma\in (1,2)$ there exists a single bipartite graph $H$ satisfying $ex(n,H)=\...