Factors in graphs with randomness

Series
Combinatorics Seminar
Time
Thursday, March 16, 2023 - 3:00pm for 1 hour (actually 50 minutes)
Location
G08 ESM (ground floor)
Speaker
Jie Han – Beijing Institute of Technology – https://jiehan773.github.io/
Organizer
Anton Bernshteyn

The celebrated Hajnal-Szemer├ędi theorem gives best possible minimum degree conditions for clique-factors in graphs. There have been some recent variants of this result into several settings, each of which has some sort of randomness come into play. We will give a survey on these problems and the recent developments.