Recent techniques and results on the Erd\H{o}s-P\'osa property
Discrete Mathematics
2016-12-14 v4 Combinatorics
Abstract
Several min-max relations in graph theory can be expressed in the framework of the Erd\H{o}s-P\'osa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques for proving this property that are related to tree-like decompositions. We also provide an unified presentation of the current state of the art on this topic.
Keywords
Cite
@article{arxiv.1603.04615,
title = {Recent techniques and results on the Erd\H{o}s-P\'osa property},
author = {Jean-Florent Raymond and Dimitrios M. Thilikos},
journal= {arXiv preprint arXiv:1603.04615},
year = {2016}
}