The speakers are Maya Stein (University of Chile), Mathias Schacht (Hamburg), János Pach (Rényi Institute, Hungary and IST Austria), Marthe Bonamy (Bordeaux), Mehtaab Sawhney (Cambridge/MIT), and Julian Sahasrabudhe (Cambridge). Please see the event website for further details including titles, abstracts, and timings. Anyone interested is welcome to attend, and no registration is required.

"Colouring" a tournament means partitioning its vertex set into acylic subsets; and the "domination number" is the size of the smallest set of vertices with no common in-neighbour. In some ways these are like the corresponding concepts for graphs, but in some ways they are very different. We give a survey of some recent results and open questions on these topics.

Joint with Tung Nguyen and Alex Scott.

We determine the minimal forbidden minors characterising the class of countable graphs that embed into some compact surface. We will also discuss Thomas’s conjecture that the Robertson—Seymour Graph Minor Theorem extends to countably infinite graphs. [https://arxiv.org/abs/2301.11042]