University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > The edge-Erdös-Posa property

The edge-Erdös-Posa property

Add to your list(s) Download to your calendar using vCal

  • UserMatthias Heinlein (Universität Ulm)
  • ClockTuesday 08 May 2018, 15:00-16:00
  • HouseWatson LTA.

If you have a question about this talk, please contact Guillem Perarnau.

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 either G contains k vertex/edge-disjoint subgraphs isomorphic to a member of F or a set X of at most f(k) vertices/edges such that G-X contains no member of F as subgraph. Erdös and Posa proved in 1965 that cycles have this property and in the past 50 years many other classes were shown to have the vertex-Erdös-Posa property. However, only few classes were investigated regarding the edge-version of the property and it has been an open problem whether the vertex property implies the edge property or vice versa. I will present some recent developments in this area. Some parts of my work is joint with Felix Joos and Henning Bruhn.

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.