Menger's theorem for countable graphs (Q1094433): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Ron Aharoni / rank | |||
Property / reviewed by | |||
Property / reviewed by: Michael Hager / rank | |||
Property / author | |||
Property / author: Ron Aharoni / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Michael Hager / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(87)90006-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2059748966 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: König's Duality Theorem for Infinite Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Menger's theorem for graphs containing no infinite paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5663905 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3292914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5799732 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian Lines in Products of Infinite Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5551152 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über Translationen und den Satz von Menger in unendlichen Graphen / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:14, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Menger's theorem for countable graphs |
scientific article |
Statements
Menger's theorem for countable graphs (English)
0 references
1987
0 references
Let be G a graph with V(G) countable and A,B\(\subseteq V(G)\). The author defines a relation on the triple (G,A,B), e.g. a web or gammoid, using families of disjoint paths which separates A and B, called waves. Using this relation he proves the countable case of the following conjecture of Erdős [see, e.g. \textit{C. St. J. A. Nash-Williams}, J. Comb. Theory 3, 286-301 (1967; Zbl 0153.258)]. In any graph there exists a set \({\mathcal P}\) of disjoint A-B paths and an A-B separating set S, such that S consists of the choice of precisely one vertex from each path in \({\mathcal P}\).
0 references
infinite graphs
0 references
relation
0 references
disjoint paths
0 references
waves
0 references
separating set
0 references