BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:The edge-Erdös-Posa property - Matthias Heinlein (
Universität Ulm)
DTSTART:20180508T140000Z
DTEND:20180508T150000Z
UID:TALK3188AT
URL:/talk/index/3188
DESCRIPTION:A class F of graphs has the vertex/edge-Erdös-Posa
property if there is a function f:N->N such that
for every natural number k and every graph G eithe
r G contains k vertex/edge-disjoint subgraphs isom
orphic to a member of F or a set X of at most f(k)
vertices/edges such that G-X contains no member o
f F as subgraph. Erdös and Posa proved in 1965 tha
t cycles have this property and in the past 50 yea
rs many other classes were shown to have the verte
x-Erdös-Posa property. However\, only few classes
were investigated regarding the edge-version of th
e property and it has been an open problem whether
the vertex property implies the edge property or
vice versa. I will present some recent development
s in this area. Some parts of my work is joint wit
h Felix Joos and Henning Bruhn.
LOCATION:Watson LTA
CONTACT:Guillem Perarnau
END:VEVENT
END:VCALENDAR