Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
This 54-minute lecture by Istvan Tomon explores the Zarankiewicz problem in hereditary graph families. Learn about the maximum number of edges possible in an n-vertex graph that doesn't contain a complete bipartite graph with vertex classes of size t, with special focus on cases where the host graph has additional structural restrictions. Discover the applications of these combinatorial problems to geometry through Tomon's overview of the topic. The talk is based on joint research with Zach Hunter, Aleksa Milkojevic, and Benny Sudakov. Tomon, who obtained his PhD from the University of Cambridge and is currently an Associate Professor at Umea University after positions at EPFL and ETH Zurich, specializes in extremal combinatorics and its applications to geometry and linear algebra.
