A short proof of Mader's J-paths theorem

被引：24

作者：

Schrijver, A

机构：

[1] Ctr Wiskunde & Informat, NL-1098 SJ Amsterdam, Netherlands

[2] Univ Amsterdam, Dept Math, NL-1018 TV Amsterdam, Netherlands

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2001年 / 82卷 / 02期

关键词：

D O I：

10.1006/jctb.2000.2029

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For an undirected graph G = (V, E) and a collection f of disjoint Subsets of V, an f-path is a path connecting different sets in f, We give a short proof of Mader's min-max theorem for the maximum number of disjoint f-paths. (C) 2001 Academic Press.

引用

页码：319 / 321

页数：3