A generalization of a theorem of Nash-Williams
Abstract
In 1972, Chvatal gave a well-known sufficient condition for a graphical sequence to be forcibly hamiltonian, and showed that in some sense his condition is best possible. Nash-Williams gave examples of forcibly hamiltonian n-sequences that do not satisfy Chvatla's condition for every n at least 5. In this note we generalize the Nash-Williams examples, and use this generalization to generate \Omega(2^n/n^.5) forcibly hamiltonian n-sequences that do not satisfy Chvatal's condition
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2021
- DOI:
- 10.48550/arXiv.2106.08735
- arXiv:
- arXiv:2106.08735
- Bibcode:
- 2021arXiv210608735B
- Keywords:
-
- Mathematics - Combinatorics;
- 05C45