C(13,10,7) = 30

Method of Construction: dynamic programming covering

Lower Bound: Sidorenko; 1996

  1  2  3  4  5  6  7  8  9 10
  1  2  3  4  5  6  7  8  9 11
  1  2  3  4  5  6  7  8  9 12
  1  2  3  4  5  6  7  8  9 13
  1  2  3  4  5  6  7  8 10 11
  1  2  3  4  5  6  7  8 10 12
  1  2  3  4  5  6  7  8 10 13
  1  2  3  4  5  6  7  8 11 12
  1  2  3  4  5  6  7  8 11 13
  1  2  3  4  5  6  7  8 12 13
  2  3  5  6  8  9 10 11 12 13
  2  5  6  7  8  9 10 11 12 13
  3  5  6  7  8  9 10 11 12 13
  1  2  3  5  6  9 10 11 12 13
  1  2  5  6  7  9 10 11 12 13
  1  3  5  6  8  9 10 11 12 13
  1  2  3  7  8  9 10 11 12 13
  1  2  3  4  8  9 10 11 12 13
  1  2  4  5  8  9 10 11 12 13
  1  3  4  6  7  9 10 11 12 13
  1  3  4  5  7  9 10 11 12 13
  1  2  4  7  8  9 10 11 12 13
  1  5  6  7  8  9 10 11 12 13
  2  3  4  5  7  9 10 11 12 13
  2  3  4  6  7  9 10 11 12 13
  1  2  4  5  6  9 10 11 12 13
  4  5  6  7  8  9 10 11 12 13
  3  4  5  6  8  9 10 11 12 13
  1  2  4  6  8  9 10 11 12 13
  3  4  6  7  8  9 10 11 12 13