BIMSA >
Research seminar in Discrete Mathematics
Research seminar in Discrete Mathematics
On the Quadratic Case of the Brown-Erd\H{o}s-S\'os Problem
On the Quadratic Case of the Brown-Erd\H{o}s-S\'os Problem
Organizers
Jie Ma
, Benjamin Sudakov
Speaker
Oleg Pikhurko
Time
Tuesday, May 12, 2026 5:05 PM - 6:15 PM
Venue
Online
Online
Zoom 787 662 9899
(BIMSA)
Abstract
In 1973, Brown, Erd\H{o}s and S\'os initiated the study of the maximum number of edges in an $n$-vertex $r$-graph such that no $k$ edges span at most $s$ vertices. If $s=rk-2k+2$ then this function is quadratic in $n$. I will present various results, joint with Stefan Glock, Felix Joos, Jaehoon Kim, Marcus K\"{u}hn, Lyuben Lichev and Shumin Sun, on this case.
Speaker Intro
Oleg Pikhurko received his undergraduate degree from L'viv State University, Ukraine, in 1995 and his PhD from the University of Cambridge, UK, in 2000. He had a Junior Research Fellowship at St John's College, Cambridge (2000-2003) and a faculty position at Carnegie Mellon University (2003-2012). He is a professor at the University of Warwick, working there since 2011. He held an ERC Starting Grant 2012-8 and is currently supported by a Leverhulme Research Project Grant (since 2019) and an ERC Advanced Grant (since 2022). His research interests include extremal and probabilistic combinatorics, descriptive combinatorics and limits of discrete structures.