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.
Automatic MiSe System Software Version 1.4803M | admin login