Recent techniques and results on the Erdős-Pósa property

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.
Complete list of metadatas

Cited literature [60 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01486771
Contributor : Jean-Florent Raymond <>
Submitted on : Tuesday, June 12, 2018 - 4:40:38 PM
Last modification on : Thursday, June 14, 2018 - 1:19:37 AM

File

survep.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Florent Raymond, Dimitrios M. Thilikos. Recent techniques and results on the Erdős-Pósa property. Discrete Applied Mathematics, Elsevier, 2017, 231, pp.25-43. ⟨10.1016/j.dam.2016.12.025⟩. ⟨lirmm-01486771v2⟩

Share

Metrics

Record views

87

Files downloads

114