Long cycles through prescribed vertices have the Erdős‐Pósa property

DOI10.1002/jgt.22156zbMath1386.05095arXiv1412.2894OpenAlexW2963509253MaRDI QIDQ4638627

Henning Bruhn, Oliver Schaudt, Felix Joos

Publication date: 27 April 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Pósa propertyrooted cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (14)

The edge-Erdős-Pósa property ⋮ A tight Erdős-Pósa function for long cycles ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles ⋮ \(K_4\)-expansions have the edge-Erdős-Pósa property ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Erdös--Pósa Property for Labeled Minors: 2-Connected Minors ⋮ Graphs without two vertex-disjoint \(S\)-cycles ⋮ $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property

This page was built for publication: Long cycles through prescribed vertices have the Erdős‐Pósa property