Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login