par Fiorini, Samuel 
;Joret, Gwenaël ;Wood, David
Référence Combinatorics, probability & computing, 22, 5, page (700-721)
Publication Publié, 2013
;Joret, Gwenaël ;Wood, David Référence Combinatorics, probability & computing, 22, 5, page (700-721)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | A classical result of Robertson and Seymour states that the set of graphs containing a fixed planar graph H as a minor has the so-called ErdÅs-Pósa property; namely, there exists a function f depending only on H such that, for every graph G and every positive integer k, the graph G has k vertex-disjoint subgraphs each containing H as a minor, or there exists a subset X of vertices of G with |
