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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 29, 2007, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Heidi Gebauer

On the Number of Hamilton Cycles in 3-regular Graphs

We derived an upper bound of 1.276^n for the number of Hamilton cycles in 3-regular graphs. A rough motivation: Finding upper bounds on Hamilton Cycles is related to the Traveling Salesman problem which is one of the most fundamental NP-complete graph-problems. In the talk I will first present some previous, more general approaches (for bounding the number of Hamilton cycles) and then describe our new approach. The main idea of the corresponding proof will be illustrated and a very rough sketch of the basic steps will be given.


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

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