BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Zarankiewicz's problem in hereditary families of graphs\, with geo
 metric applications
DTSTART:20250414T101500
DTEND:20250414T111500
DTSTAMP:20260429T112713Z
UID:a79df3b09d3bc4ef177c9ff9a30fca96aa1c5a3f0f0fe5c0ff23a8e3
CATEGORIES:Conferences - Seminars
DESCRIPTION:Aleksa Milojevic - ETH Zurich\nZarankiewicz's problem is one o
 f the central problems in extremal graph theory\, and it asks for the maxi
 mum number of edges in a bipartite graph with vertex classes of size n\, w
 hich does not contain the complete bipartite graph K_{s\, s}. In general g
 raphs\, the maximum number of such edges is at most O(n^{2-1/s})\, as show
 n by the classical Kovari-Sos-Turan theorem. In recent years\, an interest
 ing twist on this problem attracted the interest of many researchers: give
 n a family of graphs F closed under taking induced subgraphs\, what is the
  maximum number of edges in a graph of F with n vertices\, which does not 
 contain the complete bipartite graph K_{s\, s}? This setup subsumes severa
 l questions from combinatorial geometry and structural graph theory\, and 
 it turns out that the behavior of this number often depends more on the fa
 mily F than on s. We will discuss this problem for several natural familie
 s F (such as the family of graphs avoiding a fixed induced subgraph)\, and
  give some geometric applications of our results.\n\nThis talk is based on
  joint work with Zach Hunter\, Benny Sudakov and Istvan Tomon.
LOCATION:CM 1 517 https://plan.epfl.ch/?room==CM%201%20517
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR