login
Length of smallest linear covering word for covering (n-2)-subsets of an n-set.
1

%I #7 Aug 01 2018 11:53:12

%S 3,8,13,20,29,38

%N Length of smallest linear covering word for covering (n-2)-subsets of an n-set.

%D Stevens, B., Buskell, P., Ecimovic, P., Ivanescu, C., Malik, A.M., Savu, A., Vassilev, T.S., Verrall, H., Yang, B. and Zhao, Z., 2002. Solution of an outstanding conjecture: the non-existence of universal cycles with k = n- 2. Discrete Mathematics, 258(1-3), pp. 193-204.

%Y Cf. A317194.

%K nonn,more

%O 3,1

%A _N. J. A. Sloane_, Aug 01 2018