Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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)

Edge-orderings and long increasing paths in graphs

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.

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