| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777068 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
A family F of graphs has the edge-ErdÅs-Pósa property if there is a function f:NâN such that for every kâN and every graph G, the following holds: either G contains k edge-disjoint subgraphs contained in F or there is an edge set Y of size at most f(k) such that GâY does not contain any subgraph in F. We prove that the family of graphs that have K4 as a minor has the edge-ErdÅs-Pósa property.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Henning Bruhn, Matthias Heinlein,