TR-2003-07

The path-packing structure of graphs

András Sebő, László Szegő

We prove Edmonds-Gallai type structure theorems for Mader's edge- and vertex-disjoint paths including also capacitated variants, and state a conjecture generalizing Mader's minimax theorems on path packings and Cunningham and Geelen's path-matching theorem.

Bibtex entry:

@techreport{egres-03-07,

AUTHOR	=	{Seb{\H o}, Andr{\'a}s and Szeg{\H o}, L{\'a}szl{\'o}},
TITLE	=	{The path-packing structure of graphs},
NOTE	=	{{\tt egres.elte.hu}},
INSTITUTION	=	{Egerv{\'a}ry Research Group, Budapest},
YEAR	=	{2003},
NUMBER	=	{TR-2003-07}

}