Rational exponents for hypergraph Turan problems
  Given a family of $k$-hypergraphs $\mathcal{F}$, $ex(n,\mathcal{F})$ is the maximum number of edges a $k$-hypergraph can have, knowing that said hypergraph has $n$ vertices but contains no copy of any hypergraph from $\mathcal{F}$ as a subgraph. We prove that for every rational $r$ between $0$ and $k-1$, there exists some finite family $\mathcal{F}$ of $k$-hypergraphs for which $ex(n,\mathcal{F})=\Theta(n^{k-r})$. 
Matthew Fitch
math.CO