Tournaments with many Hamilton cycles

  title={Tournaments with many Hamilton cycles},
  author={Nicholas C. Wormald}
The object of interest is the maximum number, h(n), of Hamilton cycles in an n-tournament. By considering the expected number of Hamilton cycles in various classes of random tournaments, we obtain new asymptotic lower bounds on h(n). The best result so far is approximately 2.85584... times the expected number g(n) of Hamilton cycles in a random n-tournament, and it is conjectured that h(n) ∼ cg(n) where c ≈ 2.855958. The same statements hold for Hamilton paths. AMS Classifications: 05A16, 05C30… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 11 references

The dissection of equilateral triangles into equilateral triangles

W. T. Tutte
Proc. Cambridge Philos. Soc. 44 • 1948
View 9 Excerpts
Highly Influenced

On the maximum number of Hamiltonian paths in tournaments

Random Struct. Algorithms • 2001
View 6 Excerpts
Highly Influenced

The maximum number of Hamiltonian paths in tournaments

Combinatorica • 1990
View 4 Excerpts
Highly Influenced

Algebraic Graph Theory

Graduate texts in mathematics • 2001

Combinatorial Enumeration

I. P. Goulden, D. M. Jackson
Wiley, New York • 1983
View 1 Excerpt

Similar Papers

Loading similar papers…