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 (2n/n.5) forcibly hamiltonian n-sequences that do not satisfy Chvatal's condition
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.