Name
Abstract | ||
|---|---|---|
Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph G with vertex-subsets A and B, if every finite subset of A is linked to B by disjoint paths, then the whole of A can be linked to the closure of B by disjoint paths or rays in a natural topology on G and its ends. This latter theorem implies the topological Menger theorem of Diestel for locally finite graphs. It also implies a special case of the infinite Menger theorem of Aharoni and Berger. |
Year | Venue | Field |
|---|---|---|
2018 | ELECTRONIC JOURNAL OF COMBINATORICS | Matroid,Discrete mathematics,Graph,Topology,Combinatorics,Disjoint sets,Vertex (geometry),Menger's theorem,Natural topology,Mathematics |
DocType | Volume | Issue |
Journal | 25 | 3 |
ISSN | Citations | PageRank |
1077-8926 | 1 | 0.37 |
References | Authors | |
2 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Carmesin | 1 | 29 | 7.08 |