On the maximum number of Hamiltonian paths in tournaments

Random Structures and Algorithms

Volumn 18, Issue 3, 2001, Pages 291-296

  Adler, Ilan ^a   Alon, Noga ^b   Ross, Sheldon M ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035592248     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.1010     Document Type: Article

References (5)

1. N. Alon, The maximum number of Hamiltonian paths in tournaments, Combinatorica 10 (1990), 319-324.
2. N. Alon, and J.H. Spencer, The probabilistic method, Wiley, New York, 2000, 2nd ed.
3. E. Friedgut, and J. Kahn, in preparation.
4. J. Schönheim, On maximal systems of k-tuples, Studia Sci Math Hungar 1 (1966), 363-368.
5. T. Szele, Kombinatorikai vizsgálatok az irányitott teljes graffal kapcsolatban, Mat Fiz Lapok 50 (1943), 223-256.