On the Number of Hamiltonian Cycles in a Tournament
From MaRDI portal
Publication:5704389
DOI10.1017/S0963548305006863zbMath1081.05063MaRDI QIDQ5704389
Publication date: 14 November 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (5)
Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Paths of given length in tournaments ⋮ On the Maximum Number of Spanning Copies of an Orientation in a Tournament ⋮ Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
This page was built for publication: On the Number of Hamiltonian Cycles in a Tournament
