Name
Abstract | ||
|---|---|---|
A well-known conjecture of Erdõs states that given aninfinite graph G and sets A, ⊆V(G), there exists a family of disjoint A -B paths 𝓅 together with an A - Bseparator X consisting of a choice of one vertex from eachpath in 𝓅. There is a natural extension of this conjecturein which A, B, and X may contain ends as wellas vertices. We prove this extension by reducing it to the vertexversion, which was recently proved by Aharoni and Berger. ©2005 Wiley Periodicals, Inc. J Graph Theory 50: 199211, 2005 |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1002/jgt.v50:3 | Journal of Graph Theory |
Keywords | Field | DocType |
menger s theorem,ends | Graph theory,Discrete mathematics,Graph,Combinatorics,Disjoint sets,Existential quantification,k-vertex-connected graph,Vertex (geometry),Menger's theorem,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 3 | 0364-9024 |
Citations | PageRank | References |
5 | 0.45 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| henning bruhn | 1 | 177 | 24.93 |
| Reinhard Diestel | 2 | 452 | 68.24 |
| maya stein | 3 | 81 | 15.65 |