论文信息 - On the maximum number of Hamiltonian paths in tournaments

On the maximum number of Hamiltonian paths in tournaments

Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian paths in a tournament onn vertices is at mostc · n3/2· n!/2n−1, wherec is a positive constant independent ofn.

N. Alon | S. Ross | IIan Adler

[1] Henryk Minc,et al. Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices , 1963 .

[2] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .

[3] Alexander Schrijver,et al. A Short Proof of Minc's Conjecture , 1978, J. Comb. Theory, Ser. A.

[4] J. Spencer. Ten lectures on the probabilistic method , 1987 .

[5] Noga Alon. The maximum number of Hamiltonian paths in tournaments , 1990, Comb..

[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.