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

Date and Time: Tuesday, May 19, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Pascal Su

Hamilton Cycles in Random Graphs

Finding Hamilton cycles in graphs in general is NP-Hard. However, if we look at an 'average' case, that is a random graph, many questions around Hamilton cycles prove to be much easier. I will talk about some results on existence and algorithms for Hamilton cycles in random graphs.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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