Frames, $A$-Paths, and the Erdös--Pósa Property
From MaRDI portal
Publication:4564886
DOI10.1137/17M1148542zbMath1388.05096arXiv1707.02918MaRDI QIDQ4564886
Felix Joos, Henning Bruhn, Matthias Heinlein
Publication date: 7 June 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.02918
Related Items
Packing cycles in undirected group-labelled graphs ⋮ Even A‐cycles have the edge‐Erdős–Pósa property ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Packing \(A\)-paths of length zero modulo a prime ⋮ Erdös--Pósa from Ball Packing ⋮ Packing \(A\)-paths of length zero modulo four ⋮ Packing and Covering Induced Subdivisions ⋮ Erdös--Pósa Property for Labeled Minors: 2-Connected Minors ⋮ $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property
Cites Work
- Unnamed Item
- Unnamed Item
- Packing cycles with modularity constraints
- Disjoint cycles intersecting a set of vertices
- A variation of Menger's theorem for long paths
- Packing non-zero \(A\)-paths in group-labelled graphs
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
- Graph minors. V. Excluding a planar graph
- Über die Maximalzahl kantendisjunkter A-Wege
- Packing directed circuits
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Graph minors. XIII: The disjoint paths problem
- Packing \(A\)-paths of length zero modulo four
- Packing cycles through prescribed vertices
- A tight Erdős-Pósa function for long cycles
- Long cycles have the Edge-Erdős-Pósa property
- The Erdős-Pósa property for long circuits
- On the odd-minor variant of Hadwiger's conjecture
- Disjoint \(A\)-paths in digraphs
- A Tighter Erdős-Pósa Function for Long Cycles
- The Directed Grid Theorem
- On the presence of disjoint subgraphs of a specified type
- Long cycles through prescribed vertices have the Erdős‐Pósa property
- Packing Directed Circuits through Prescribed Vertices Bounded Fractionally
- On Independent Circuits Contained in a Graph
- Large-treewidth graph decompositions and applications
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- Orientations of infinite graphs with prescribed edge-connectivity
This page was built for publication: Frames, $A$-Paths, and the Erdös--Pósa Property
