Abstract
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.
Original language | English |
---|---|
Journal | Discrete Mathematics |
Volume | 313 |
Issue number | 15 |
Pages (from-to) | 1569-1574 |
ISSN | 0012-365X |
DOIs | |
Publication status | Published - 2013 |
Keywords
- Minimal codewords
- Intersecting codes
- Matroid theory
- Cycle code of graphs