Localized Erdos-P\'osa Property for Subdivisions
Abstract
For a graph H, we say that H has the Erdos-P\'osa property for subdivisions with function f, if for every graph G, either G contains (as a subgraph) k+1 pairwise disjoint subdivisions of H or there exists a set X⊂eq G such that G X contains no H-subdivision and |X|≤ f(k). We show that every H that has the property for subdivision also satisfies a localized version of the property, as follows. Let H be an n-vertex graph with m≥ 1 edges that has the Erdos-P\'osa property for subdivisions with function f, and let G be a graph that does not contain k+1 disjoint subdivisions of H. We demonstrate the existence of a set of at most k vertex disjoint subdivisions of H in G such that in their union, we can find a set X with the property that G X contains no H-subdivision and |X| ≤ 2f(k)mk +k(m-n).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.