K4-subdivisions have the edge-Erdos-P\'osa property
Abstract
We prove that every graph G contains either k edge-disjoint K4-subdivisions or a set X of at most O(k8 k) edges such that G-X does not contain any K4-subdivision. This shows that K4-subdivisions have the edge-Erdos-P\'osa property.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.