Discrete Mathematics and Optimization Seminar
Dec. 1, 2008
On the number of Hamilton Cycles in 3-regular graphs
Heidi Gebauer
ETH Zurich
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.