## Embedding spanning structures into vertex-ordered graphs

Series
Graph Theory Seminar
Time
Tuesday, December 1, 2020 - 3:45pm for 1 hour (actually 50 minutes)
Location
https://us04web.zoom.us/j/77238664391. For password, please email Anton Bernshteyn (bahtoh ~at~ gatech.edu)
Speaker
Andrew Treglown – University of Birmingham – a.c.treglown@bham.ac.ukhttp://web.mat.bham.ac.uk/A.Treglown/
Organizer

Over recent years there has been much interest in both Turán and Ramsey properties of vertex ordered graphs (i.e., graphs equipped with an ordering of their vertex set). In a recent paper, József Balogh, Lina Li and I initiated the study of embedding spanning structures into vertex ordered graphs. In particular, we introduced a general framework for approaching the problem of determining the minimum degree threshold for forcing a perfect $H$-tiling in an ordered graph. In this talk I will discuss this work, in particular emphasizing how we adapt the regularity and absorbing methods to be applicable in the ordered setting.