K4-expansions have the edge-Erdős-Pósa property

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.