A338512 a(n) is the number of Chvátal-satisfying graphical n-sequences.
6, 24, 67, 263, 823, 3276, 10839, 43287, 147943
Offset: 5
Links
- Douglas Bauer, Linda Lesniak, Aori Nevo, and Edward Schmeichel, On the necessity of Chvátal’s Hamiltonian degree condition, AKCE International Journal of Graphs and Combinatorics. See p. 2.
- Vacláv Chvátal, On Hamilton’s ideals, J. Combin. Theory Ser. B 12(2): 163-168 (1972).
Formula
a(n) = O(4^n/n^3) where O indicates the big O notation (see Ref. 2 in Bauer).