$K_4$-Subdivisions Have the Edge-Erdös--Pósa Property

DOI10.1137/18M1216511zbMath1460.05153arXiv1808.10380OpenAlexW3139476213MaRDI QIDQ5857001

Matthias Heinlein, Henning Bruhn-Fujimoto

Publication date: 30 March 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.10380

zbMATH Keywords

Erdős-Pósa propertyhitting setedge-disjoint\(K_4\)-subdivisions

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Related Items (2)

The edge-Erdős-Pósa property ⋮ Even A‐cycles have the edge‐Erdős–Pósa property

Cites Work

• Unnamed Item
• Unnamed Item
• An edge variant of the Erdős-Pósa property
• Packing cycles with modularity constraints
• Disjoint cycles intersecting a set of vertices
• Graph minors. V. Excluding a planar graph
• Parallel recognition of series-parallel graphs
• Über die Maximalzahl kantendisjunkter A-Wege
• Packing cycles through prescribed vertices
• Recent techniques and results on the Erdős-Pósa property
• Long cycles have the Edge-Erdős-Pósa property
• A unified Erdős-Pósa theorem for constrained cycles
• On the presence of disjoint subgraphs of a specified type
• Frames, $A$-Paths, and the Erdös--Pósa Property
• Long cycles through prescribed vertices have the Erdős‐Pósa property
• Packing Directed Circuits through Prescribed Vertices Bounded Fractionally
• A tight Erdős-Pósa function for planar minors
• On Independent Circuits Contained in a Graph
• A Tight Erdös--Pósa Function for Wheel Minors
• Excluded Forest Minors and the Erdős–Pósa Property
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen

This page was built for publication: $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property