BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:Rainbow spanning subgraphs of graphs with large mi
nimum degree - Matthew Coulson (University of Birm
ingham)
DTSTART:20180206T150000Z
DTEND:20180206T160000Z
UID:TALK3041AT
URL:/talk/index/3041
DESCRIPTION:If G is an edge coloured graph of order n\, we say
a subgraph H is rainbow if each edge of H has a d
ifferent colour. Allowing the colouring of G to be
arbitrary makes it easy to avoid all non-trivial
rainbow spanning subgraphs. Suppose instead that t
he colouring is k-bounded\, we ask how large k can
be for certain pairings of graphs G with a spanni
ng subgraph H. The case in which G is complete was
solved by Böttcher\, Kohayakawa and Procacci. We
will exhibit some graphs H where taking the minimu
m degree of G to be slightly above H's containment
threshold allows us to find a rainbow copy of H i
n G for any μn-bounded colouring of G.\n\nJoint wo
rk with Peter Keevash\, Guillem Perarnau and Liana
Yepremyan.
LOCATION:Physics West 106
CONTACT:Allan Lo
END:VEVENT
END:VCALENDAR