Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949492 | Discrete Applied Mathematics | 2017 | 19 Pages |
Abstract
Several min-max relations in graph theory can be expressed in the framework of the ErdÅs-Pósa 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
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jean-Florent Raymond, Dimitrios M. Thilikos,