BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability seminar
SUMMARY:Resilient degree sequences with respect to Hamilto
nicity in random graphs - Alberto Espuny\, Univers
ity of Birmingham
DTSTART:20181213T150000Z
DTEND:20181213T160000Z
UID:TALK3346AT
URL:/talk/index/3346
DESCRIPTION:The local resilience of a graph with respect to a
property P can be defined as the maximum number of
edges incident to each vertex that an adversary c
an delete without destroying P. The resilience of
random graphs with respect to various properties h
as received much attention in recent years. We inv
estigate a notion of local resilience in which the
adversary is allowed to delete a different number
of edges at each vertex\, and obtain some results
which improve on previous results.\n\nThis is joi
nt work with P. Condon\, J. Kim\, D. Kühn and D. O
sthus.
LOCATION:Watson LTB
CONTACT:Johannes Carmesin
END:VEVENT
END:VCALENDAR