A generalization of a theorem of NashWilliams
Abstract
In 1972, Chvatal gave a wellknown sufficient condition for a graphical sequence to be forcibly hamiltonian, and showed that in some sense his condition is best possible. NashWilliams gave examples of forcibly hamiltonian nsequences that do not satisfy Chvatla's condition for every n at least 5. In this note we generalize the NashWilliams examples, and use this generalization to generate \Omega(2^n/n^.5) forcibly hamiltonian nsequences that do not satisfy Chvatal's condition
 Publication:

arXiv eprints
 Pub Date:
 June 2021
 DOI:
 10.48550/arXiv.2106.08735
 arXiv:
 arXiv:2106.08735
 Bibcode:
 2021arXiv210608735B
 Keywords:

 Mathematics  Combinatorics;
 05C45