Title:Generalizing the problem of packing disjoint cycles
| Speaker: | Paul Wollan |
| Affiliation: | University of Rome "La Sapienza" |
| Room: | MC 5479 |
Abstract: A classic result of Erdos and Posa states that there exists a function f such that for all k, a graph either contains k disjoint cycles or there exists a set of at most f(k) vertices intersecting all cycles in the graph, yielding an approximate min-max relationship on the number of disjoint cycles. This result has been extended to a number of variations - we will describe recent work on a common generalization of these extensions via group labeled graphs.
We will go into further detail on how tangles arise in a natural way when considering similar problems of packing disjoint cycles and examine how that allows one to apply graph minors techniques to confront the problem.