A note on the number of Hamiltonian paths in strong tournaments
type: Item
instance of: scholarly article
title: A note on the number of Hamiltonian paths in strong tournaments
zbMATH Open document ID: 1080.05038
author: Arthur H. Busch
published in: The Electronic Journal of Combinatorics
publication date: 2006-02-09T00:00:00Z
full work available at URL: https://eudml.org/doc/125519
full work available at URL: v13i1n3.html
review text: Summary: We prove that the minimum number of distinct Hamiltonian paths in a strong tournament of order \(n\) is \(5^{\frac {n-1}3}\). A known construction shows this number is best possible when \(n \equiv 1 \bmod 3\) and gives similar minimal values for \(n\) congruent to 0 and 2 modulo 3.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 5005206
MaRDI profile type: Publication
Recommended article: Q3743331
Recommended article: Q3595115
Recommended article: On the maximum number of Hamiltonian paths in tournaments
Recommended article: The maximum number of Hamiltonian paths in tournaments
Recommended article: About the number of oriented Hamiltonian paths and cycles in tournaments
Recommended article: On the Number of Hamiltonian Cycles in a Tournament
Recommended article: Q3218154
Recommended article: Tight bounds for powers of Hamilton cycles in tournaments
Recommended article: Q3680863
description: scientific article; zbMATH DE number 5005206