A unified Erdős-Pósa theorem for constrained cycles

DOI10.1007/s00493-017-3683-zzbMath1438.05198arXiv1605.07082OpenAlexW3102947642MaRDI QIDQ2416515

Felix Joos, Toni Huynh, Paul Wollan

Publication date: 23 May 2019

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

packingoriented graphlabeled graphErdős-Pósa propertyconstrained cyclesflat wall theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (11)

The edge-Erdős-Pósa property ⋮ Finding a path with two labels forbidden in group-labeled graphs ⋮ Packing cycles in undirected group-labelled graphs ⋮ On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Packing \(A\)-paths of length zero modulo a prime ⋮ Packing \(A\)-paths of length zero modulo four ⋮ 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: A unified Erdős-Pósa theorem for constrained cycles