Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, July 11, 2017, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Anders Martinsson (Chalmers University)
The altitude of a graph G is defined as the largest integer k such that any edge-ordering of G contains an increasing self-avoiding path of length k. In 1971, Chvatal and Komlos asked for the altitude of the complete graph on n vertices. Altitudes of graphs has later been studied in various settings. In this talk, I will give an overview of the topic and discuss some of the ideas involved. In particular I will discuss some recent results in probabilistic versions of the problem, including work by me.
Automatic MiSe System Software Version 1.4803M | admin login