A338512 - OEIS

%I #13 Nov 09 2020 09:58:37

%S 6,24,67,263,823,3276,10839,43287,147943

%N a(n) is the number of Chvátal-satisfying graphical n-sequences.

%H Douglas Bauer, Linda Lesniak, Aori Nevo, and Edward Schmeichel, <a href="https://doi.org/10.1080/09728600.2020.1834337">On the necessity of Chvátal’s Hamiltonian degree condition</a>, AKCE International Journal of Graphs and Combinatorics. See p. 2.

%H Vacláv Chvátal, <a href="https://doi.org/10.1016/0095-8956(72)90020-2">On Hamilton’s ideals</a>, J. Combin. Theory Ser. B 12(2): 163-168 (1972).

%F a(n) = O(4^n/n^3) where O indicates the big O notation (see Ref. 2 in Bauer).

%Y Cf. A000302, A000578.

%Y Cf. A000569, A004251, A338513 (spurious version).

%K nonn,more

%O 5,1

%A _Stefano Spezia_, Nov 01 2020