Packing A-paths of length zero modulo four
From MaRDI portal
Packing \(A\)-paths of length zero modulo four
Abstract: We show that A-paths of length 0 modulo 4 have the ErdH{o}s-P'osa property. We also prove that A-paths of length 2 modulo 4 have the property but that A-paths of length 1 or of length 3 modulo 4 do not have it.
Recommendations
Cites work
- A unified Erdős-Pósa theorem for constrained cycles
- Disjoint A-paths in digraphs
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Graph theory
- Graph theory
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- On Independent Circuits Contained in a Graph
- On the presence of disjoint subgraphs of a specified type
- Packing cycles with modularity constraints
- Packing directed circuits
- Packing non-zero A-paths in an undirected model of group labeled graphs
- Quickly excluding a planar graph
- Recent techniques and results on the Erdős-Pósa property
- The directed grid theorem
Cited in
(4)
This page was built for publication: Packing \(A\)-paths of length zero modulo four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237857)