Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information
Date and Time: Thursday, November 29, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Heidi Gebauer
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.
Automatic MiSe System Software Version 1.4803M | admin login