Packing non-returning A-paths (Q2460627): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00493-007-0056-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2100674553 / rank | |||
Normal rank |
Latest revision as of 03:00, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing non-returning A-paths |
scientific article |
Statements
Packing non-returning A-paths (English)
0 references
12 November 2007
0 references
Recently, \textit{M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman} and \textit{P. Seymour} [Combinatorica 26, No. 5, 521--532 (2006; Zbl 1127.05050)] gave a min-max formula for the maximum number of node-disjoint non-zero \(A\)-paths in group-labeled graphs, which generalize a result of \textit{W. Mader} [Arch. Math. 30, 325--336 (1978; Zbl 0354.05042)] on node-disjoint \(A\)-paths. Using an analogue of Berge's alternating paths' lemma, the author presents a further generalization with a shorter proof. The method is related to a short proof of Mader's theorem given by \textit{A. Schrijver}[J. Comb. Theory, Ser. B 82, No. 2, 319--321 (2001; Zbl 1027.05051)].
0 references
path
0 references
\(A\)-path
0 references