Talks
Spring 2017

A Fast New Algorithm for Weak Graph Regularity

Monday, June 18th, 2018 10:15 am10:45 am

Add to Calendar

Regularity lemmas are very useful tools in graph theory and theoretical computer science. In this talk, I'll discuss a recent deterministic algorithm that finds, in $\epsilon^{-O(1)} n^2$ time, an $\epsilon$-regular Frieze--Kannan partition of a graph on $n$ vertices. The algorithm outputs an approximation of a given graph as a weighted sum of $\epsilon^{-O(1)}$ many complete bipartite graphs. Joint work with Jacob Fox and Yufei Zhao.