On the number of Hamiltonian cycles in tournaments
Copyright policy )On the number of Hamiltonian cycles in tournaments
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at least exponentially with the minimum outdegree of the tournament. Finally, for each k⩾1 there are infinitely many tournaments with precisely k Hamiltonian cycles.
Eulerian and Hamiltonian graphs, Hamiltonian bypasses, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, strong tournament, Hamiltonian cycles, Hamiltonian paths, Theoretical Computer Science
Eulerian and Hamiltonian graphs, Hamiltonian bypasses, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, strong tournament, Hamiltonian cycles, Hamiltonian paths, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).13 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!