论文信息 - Menger's theorem for countable graphs

Menger's theorem for countable graphs

Abstract The countable case of a conjecture of Erdos is settled: let G = (V, E) be a directed or undirected graph, where V is countable, and let A, B⊆V. There exists then a set P of disjoint A − B paths and an A − B separating set S of vertices so that S consists of the choice of precisely one vertex from each path in P .

Ron Aharoni | R. Aharoni

[1] K. P. Podewski,et al. Über Translationen und den Satz von Menger in unendlichen Graphen , 1977 .

[2] Ron Aharoni,et al. Menger's Theorem for Graphs Containing no Infinite Paths , 1983, Eur. J. Comb..

[3] G. Dirac,et al. On separating sets and menger's theorem , 1973 .

[4] C. Nash-Williams,et al. Infinite graphs—A survey , 1967 .

[5] Ron Aharoni. König's Duality Theorem for Infinite Bipartite Graphs , 1984 .

[6] L. Vietoris. Theorie der endlichen und unendlichen Graphen , 1937 .

[7] Hazel Perfect,et al. Addendum: An extension of Banach's mapping theorem with applications to problems concerning common representatives , 1966, Mathematical Proceedings of the Cambridge Philosophical Society.

[8] D. Koenig. Theorie Der Endlichen Und Unendlichen Graphen , 1965 .