Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Friday, May 03, 2019, 02:15 pm
Duration: 45 minutes
Location: CAB G 11
Speaker: Nathan Linial (The Hebrew University of Jerusalem)
In this talk I will discuss the following question: “to what extent can a finite graph behave like the infinite d-regular tree”? We will see that this naive-sounding question holds many mysteries and fascinating challenges. Here is an example: Let girth(G) denote the smallest length of a cycle in the graph G. Question: Do there exist graphs G with no vertices of degree 1 or 2 for which girth(G)-diameter(G) is arbitrarily large? To the best of my knowledge the answer is till unknown.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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