

A334123


Number of labeled tournaments on n vertices with the maximum number of Hamiltonian paths.


0




OFFSET

1,2


COMMENTS

The maximum number of Hamiltonian paths in a tournament on n vertices is given by A038375.


LINKS



EXAMPLE

For n = 4, the a(4) = 24 labeled tournaments with A038375(4) = 5 Hamiltonian paths are all isomorphic to the tournament on vertices {1,2,3,4} with edges {(1,2),(1,3),(2,3),(2,4),(3,4),(4,1)}, which have the following Hamiltonian paths:
1>2>3>4,
2>3>4>1,
3>4>1>2,
4>1>2>3, and
2>4>1>3.


CROSSREFS



KEYWORD

nonn,more


AUTHOR



STATUS

approved



