2000 character limit reached
$K_4$-subdivisions have the edge-Erdős-Pósa property
Published 30 Aug 2018 in math.CO | (1808.10380v1)
Abstract: We prove that every graph $G$ contains either $k$ edge-disjoint $K_4$-subdivisions or a set $X$ of at most $O(k8 \log k)$ edges such that $G-X$ does not contain any $K_4$-subdivision. This shows that $K_4$-subdivisions have the edge-Erd\H{o}s-P\'osa property.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.