Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, June 14, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Ron Aharoni (Technion, Haifa)
We prove that Menger's theorem is valid for infinite graphs, in the following strong form: given two sets of vertices, A and B, in a possibly infinite digraph, there exist a set cp of disjoint A-B paths, and a set S of vertices separating A from B, such that S consists of a choice of precisely one vertex from each path in cp. This settles an old conjecture of Erdős.
Automatic MiSe System Software Version 1.4803M | admin login