Alahmadi, A.7; Aldred, R. E. L.8; de la Cruz, R.5; Solé, P.6; Thomassen, Carsten1
1 Department of Applied Mathematics and Computer Science, Technical University of Denmark2 Algorithms and Logic, Department of Applied Mathematics and Computer Science, Technical University of Denmark3 King Abdulaziz University4 University of Otago5 Nanyang Technological University6 Télécom ParisTech7 King Abdulaziz University8 University of Otago
We survey some upper and lower bounds on the function in the title, and make them explicit for n≤15 and 1≤k≤15. Exact values are given for cycle codes of graphs for 3≤n≤15 and 1≤k≤13.
Discrete Mathematics, 2013, Vol 313, Issue 15, p. 1569-1574
Minimal codewords; Intersecting codes; Matroid theory; Cycle code of graphs