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, March 15, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Tomasz Łuczak (Adam Mickiewicz University)

Yet another problem concerning Hamiltonian cycles in random graphs

Since the threshold for the hamiltonicity of G(n,M) was found in the late seventies more than 150 papers dealing with Hamilton cycles in random graphs have been published. They have presented so many different ways to approach this topic that one wonders if there is anything left to be done in this area. Well, it might be. I will present one such result and use it to say a few words on a recent "topological direction" in the theory of random discrete structures. This is a joint work with Peter Heinig.

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