On the maximum number of Hamiltonian paths in tournaments
From MaRDI portal
Publication:2725034
DOI10.1002/rsa.1010zbMath0982.05056OpenAlexW4243451311MaRDI QIDQ2725034
Sheldon M. Ross, Noga Alon, Ilan Adler
Publication date: 29 March 2002
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.1010
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (7)
A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Paths of given length in tournaments ⋮ On the Maximum Number of Spanning Copies of an Orientation in a Tournament ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Tournament quasirandomness from local counting ⋮ Contagion in networks: stability and efficiency ⋮ Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
Cites Work
This page was built for publication: On the maximum number of Hamiltonian paths in tournaments
