BIMSA >
Research seminar in Discrete Mathematics
Research seminar in Discrete Mathematics
Some problems in coarse graph theory
Some problems in coarse graph theory
Organizers
Jie Ma
, Benjamin Sudakov
Speaker
Alexander Scott
Time
Tuesday, April 28, 2026 5:05 PM - 6:15 PM
Venue
Online
Online
Zoom 787 662 9899
(BIMSA)
Abstract
Coarse graph theory is a developing area, which focuses on the large-scale geometric structure of graphs, particularly through the lens of quasi-isometry. A central goal here is to find coarse analogues of classical graph-theoretic results. We discuss some current progress in this direction. Joint work with Tung Nguyen and Paul Seymour.
Speaker Intro
Alex Scott is a Professor of Mathematics at the University of Oxford and a fellow of Merton College, Oxford. He received his PhD from Cambridge University, and then had positions in Cambridge and at UCL before moving to Oxford. He was an invited speaker at the 2022 International Congress of Mathematicians. His research lies in extremal and probabilistic combinatorics, structural graph theory, and related areas of probability and computer science. More information can be found on his webpage: https://people.maths.ox.ac.uk/scott/