Menger's theorem for infinite graphs
From MaRDI portal
Publication:1016232
DOI10.1007/s00222-008-0157-3zbMath1216.05092arXivmath/0509397OpenAlexW2076891803WikidataQ55967026 ScholiaQ55967026MaRDI QIDQ1016232
Publication date: 5 May 2009
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0509397
Related Items
Matroid intersection, base packing and base covering for infinite matroids, Disjoint dijoins for classes of dicuts in finite and infinite digraphs, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, Graph-like continua, augmenting arcs, and Menger's theorem, Countable Menger's theorem with finitary matroid constraints on the ingoing edges, Topological infinite gammoids, and a new Menger-type theorem for infinite graphs, The Max-Flow Min-Cut theorem for countable networks, On the infinite Lucchesi–Younger conjecture I, Greedoids from flames, The Lovász-Cherkassky theorem for locally finite graphs with ends, The Lovász-Cherkassky theorem in countable graphs, Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\), Reducing the dichromatic number via cycle reversions in infinite digraphs, Proof of Nash-Williams' intersection conjecture for countable matroids, On the intersection conjecture for infinite trees of matroids, Enlarging vertex-flames in countable digraphs, On the intersection of infinite matroids, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, Infinite gammoids, Unnamed Item, Locally finite graphs with ends: A topological approach. II: Applications, Strongly maximal antichains in posets, Minimal covers of infinite hypergraphs, A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Menger's theorem for graphs containing no infinite paths
- Matchings in graphs of size \(\aleph_ 1\)
- Matching theory
- Menger's theorem for countable graphs
- Matchings in infinite graphs
- Infinite matching theory
- Greene-Kleitman's theorem for infinite posets
- Necessary and sufficient conditions for transversals of countable set systems
- Marriage in denumerable societies
- On Dilworth's decomposition theorem
- Injective choice functions for countable families
- A counterexample to Aharoni's strongly maximal matching conjecture
- A General Criterion for the Existence of Transversals
- Über Translationen und den Satz von Menger in unendlichen Graphen
- Another Criterion for Marriage in Denumerable Societies
- Menger's Theorem for a Countable Source Set
- On Representatives of Subsets
- Infinite graphs—A survey
- Ein Neuer Beweis Eines Mengerschen Satzes
