What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments
classification
🧮 math.CO
keywords
askedcycleshamiltonmosertournamentsconstructioncountingexplicit
read the original abstract
Moser asked for a construction of explicit tournaments on $n$ vertices having at least $(\frac{n}{3e})^n$ Hamilton cycles. We show that he could have asked for rather more.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.