We prove that every graph $G$ contains either $k$ edge-disjoint $K_4$-subdivisions or a set $X$ of at most $\ensuremath{O}(k^8 \log k)$ edges such that $G-X$ does not contain any $K_4$-subdivision. This shows that $K_4$-subdivisions have the edge-Erdös--Pósa property.

A key feature of Simonovits' proof of the classic Erdös--Pósa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique to $A$-paths. With it we deduce a simple proof of Gallai's theorem, although with a worse bound, and we verify the Erdös--Pósa property for long and for even $A$-paths. We also show that even $A$-paths do not have the edge-Erdös--Pósa property.