For a graph , we say that has the Erdős-Pósa property for subdivisions with function , if for every graph , either contains (as a subgraph) pairwise disjoint subdivisions of or there exists a set such that contains no -subdivision and . We show that every that has the \EP property for subdivision also satisfies a localized version of the \EP property, as follows. Let be an -vertex graph with edges that has the Erdős-Pósa property for subdivisions with function , and let be a graph that does not contain disjoint subdivisions of . We demonstrate the existence of a set of at most vertex disjoint subdivisions of in such that in their union, we can find a set with the property that contains no -subdivision and .

生成讲解博客的中文版本

生成AI智能校验的中文版本