BIMSA >
Research seminar in Discrete Mathematics
Research seminar in Discrete Mathematics
Zarankiewicz in hereditary families
Zarankiewicz in hereditary families
Organizer
Benjamin Sudakov
Speaker
Istvan Tomon
Time
Tuesday, April 8, 2025 5:05 PM - 6:15 PM
Venue
Online
Online
Zoom 787 662 9899
(BIMSA)
Abstract
The celebrated Zarankiewicz problem asks for the maximum number of edges in a graph on $n$ vertices which does not contain the complete bipartite graph with vertex classes of size $t$. Problems in which the $n$ vertex host graph is assumed to have further structural restrictions gained a lot of popularity in the past decades. I will give an overview of this topic and discuss its applications to geometry. Based on joint works with Zach Hunter, Aleksa Milkojevic, and Benny Sudakov.
Speaker Intro
I am an Associate Professor at Umeå University in Sweden. I love combinatorics problems which have some spice to them, especially the ones with some flavor of geometry or linear algebra.