BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:A degree sequence Komlós theorem - Joseph Hyde (Un
iversity of Birmingham)
DTSTART:20191114T140000Z
DTEND:20191114T150000Z
UID:TALK3943AT
URL:/talk/index/3943
DESCRIPTION:Given graphs G and H\, we define an H-tiling in G
to be a collection of vertex-disjoint copies of H
in G. Let η > 0. We call an H-tiling perfect if it
covers all of the vertices in G and η-almost perf
ect if it covers all but at most an η-proportion o
f the vertices in G. An important theorem of Komló
s provides the minimum degree of G which ensures a
n η-almost perfect H-tiling in G. We present a deg
ree sequence strengthening of this result and prov
ide a proof sketch. This is joint work with Hong L
iu and Andrew Treglown.\n\nUsing the aforementione
d theorem of Komlós\, Kühn and Osthus determined t
he minimum degree of G that ensures a perfect H-ti
ling in G. We present a degree sequence version of
their result as an application of our degree sequ
ence Komlós theorem. This is joint work with Andre
w Treglown.
LOCATION:Watson LTB
CONTACT:Eoin Long
END:VEVENT
END:VCALENDAR