This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
I. Adler , N. Alon and S. M. Ross (2001) On the maximum number of Hamiltonian paths in tournaments. Random Struct. Alg. 18 291–296.
N. Alon (1990) The maximum number of Hamiltonian paths in tournaments. Combinatorica 10 319–324.
N. Alon and J. Spencer (2000) The Probabilistic Method, 2nd edn, Wiley-Interscience, New York.
E. Friedgut and J. Kahn (2005) On the number of Hamiltonian cycles in a tournament. Combin. Probab. Comput. 14 769–781.
G. Grimmett (1999) Percolation, 2nd edn, Springer, New York.
C. J. H. McDiarmid (1989) On the method of bounded differences. In Surveys in Combinatorics 1989: Invited Papers at the 12th British Combinatorial Conference (J. Siemons , ed.), Cambridge University Press, pp. 148–188.
J. Radhakrishnan (1997) An entropy proof of Brégman's Theorem. J. Combin. Theory Ser. A 77 161–164.
A. Schrijver (1978) A short proof of Minc's conjecture. J. Combin. Theory Ser. A 25 80–83.
C. Thomassen (1980) Hamiltonian-connected tournaments J. Combin. Theory Ser. B 28 142–163.