Packing and covering induced subdivisions
O-joung Kwon, Jean-Florent Raymond

TL;DR
This paper investigates which graphs have the induced Erdős-Pósa property for their subdivisions, fully characterizing forests and bipartite graphs, and identifying necessary conditions for other graphs.
Contribution
It completely characterizes when the class of H-subdivisions has the induced Erdős-Pósa property for forests and bipartite graphs, and provides necessary conditions for other graphs.
Findings
Forests and complete bipartite graphs have the induced Erdős-Pósa property for their subdivisions.
The class of H-subdivisions has the induced Erdős-Pósa property for diamonds, 1-pan, and 2-pan graphs.
Necessary conditions are identified for graphs H to have the property, with constructions showing when it does not hold.
Abstract
A class of graphs has the induced Erd\H{o}s-P\'osa property if there exists a function such that for every graph and every positive integer , contains either pairwise vertex-disjoint induced subgraphs that belong to , or a vertex set of size at most hitting all induced copies of graphs in . Kim and Kwon (SODA'18) showed that for a cycle of length , the class of -subdivisions has the induced Erd\H{o}s-P\'osa property if and only if . In this paper, we investigate whether or not the class of -subdivisions has the induced Erd\H{o}s-P\'osa property for other graphs . We completely settle the case when is a forest or a complete bipartite graph. Regarding the general case, we identify necessary conditions on for the class of -subdivisions to have the induced…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
