Menger's theorem for graphs containing no infinite paths

DOI10.1016/S0195-6698(83)80012-2zbMath0525.05043WikidataQ56474527 ScholiaQ56474527MaRDI QIDQ594106

Ron Aharoni

Publication date: 1983

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

matchingseparating setMenger's theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (7)

Menger's theorem for countable graphs ⋮ The Max-Flow Min-Cut theorem for countable networks ⋮ Infinite matching theory ⋮ The Erdős-Menger conjecture for source/sink sets with disjoint closures ⋮ A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets ⋮ Menger's theorem for infinite graphs ⋮ A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory

Cites Work

• Über Translationen und den Satz von Menger in unendlichen Graphen
• On a Duality Principle in Infinite Bipartite Graphs
• König's Duality Theorem for Infinite Bipartite Graphs
• Infinite graphs—A survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Menger's theorem for graphs containing no infinite paths