What Moser <em>Could</em> Have Asked: Counting Hamilton Cycles in Tournaments

DOI10.4169/AMER.MATH.MONTHLY.123.4.382MaRDI QIDQ4576109zbMATH OpenOpenAlexWikidataFDO

Authors Neil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa

Publication date 12 July 2018

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.00699

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Abstract: Moser asked for a construction of explicit tournaments on $n$ vertices having at least $(fracn3e{)}^n$ Hamilton cycles. We show that he could have asked for rather more.

Cites work

• Central and local limit theorems applied to asymptotic enumeration
• Hamiltonian Cycles in Regular Tournaments
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• scientific article; zbMATH DE number 863491 (Why is no real title available?)
• scientific article; zbMATH DE number 3285977 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• The maximum number of Hamiltonian paths in tournaments

This page was built for publication: What Moser <em>Could</em> Have Asked: Counting Hamilton Cycles in Tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576109)