Jacob Fox “Bounded VC-dimension and Extremal Graph Theory” | MLC ’20

The talk by Jacob Fox (Stanford University, US) “Bounded VC-dimension and Extremal Graph Theory“ that he made on the conference “Machine Learning and Combinatorics 2020“ at MIPT. Abstract: We survey a variety of tools and results on extremal problems for graphs of bounded VC-dimension. This is based on joint works with János Pach and Andrew Suk.