Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.