English

What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments

Combinatorics 2015-06-03 v1

Abstract

Moser asked for a construction of explicit tournaments on nn vertices having at least (n3e)n(\frac{n}{3e})^n Hamilton cycles. We show that he could have asked for rather more.

Keywords

Cite

@article{arxiv.1506.00699,
  title  = {What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments},
  author = {Neil J. Calkin and Beth Novick and Hayato Ushijima-Mwesigwa},
  journal= {arXiv preprint arXiv:1506.00699},
  year   = {2015}
}