Combinatorics Seminar
by Oliver Janzer (École Polytechnique Fédérale de Lausanne)
The rational exponents conjecture of Erdos and Simonovits states that for every rational $r\in [1,2]$, there exists a graph $H$ such that $\mathrm{ex}(n,H)=\Theta(n^r)$. In this talk, I will survey the progress made over the past decade in understanding the extremal number of bipartite graphs and explain how AI built on these advances to complete the proof of the conjecture.
