Frames, $A$-paths and the Erdős-Pósa property
Preprint
Abstract
A key feature of Simonovits' proof of the classic Erd\H{o}s-P\'osa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique to $A$-paths. With it we deduce a simple proof of Gallai's theorem, although with a worse bound, and we verify the Erd\H{o}s-P\'osa property for long and for even $A$-paths. We also show that even $A$-paths do not have the edge-Erd\H{o}s-P\'osa property.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Disjoint cycles intersecting a set of verticesJournal of Combinatorial Theory, Series B, 2012
- Packing cycles through prescribed verticesJournal of Combinatorial Theory, Series B, 2011
- Packing non-zero A-paths in an undirected model of group labeled graphsJournal of Combinatorial Theory, Series B, 2010
- On the odd-minor variant of Hadwiger's conjectureJournal of Combinatorial Theory, Series B, 2009
- Packing Non-Zero A-Paths In Group-Labelled GraphsCombinatorica, 2006
- Disjoint A-paths in digraphsJournal of Combinatorial Theory, Series B, 2005
- A Short Proof of Mader's S-Paths TheoremJournal of Combinatorial Theory, Series B, 2001
- On the presence of disjoint subgraphs of a specified typeJournal of Graph Theory, 1988
- Graph minors. V. Excluding a planar graphJournal of Combinatorial Theory, Series B, 1986
- ber die Maximalzahl kantendisjunkterA- WegeArchiv der Mathematik, 1978