C(10,7,5) = 20

Method of Construction: dynamic programming covering

Lower Bound: Mills and Mullin

  1  2  3  4  5  6  7
  1  2  3  4  5  6  8
  1  2  3  4  5  6  9
  1  2  3  4  5  6 10
  1  2  3  4  5  7  8
  1  2  3  4  5  7  9
  1  2  3  4  5  7 10
  1  2  3  4  5  8  9
  1  2  3  4  5  8 10
  1  2  3  4  5  9 10
  1  2  6  7  8  9 10
  1  3  6  7  8  9 10
  1  4  6  7  8  9 10
  1  5  6  7  8  9 10
  2  3  6  7  8  9 10
  2  4  6  7  8  9 10
  2  5  6  7  8  9 10
  3  4  6  7  8  9 10
  3  5  6  7  8  9 10
  4  5  6  7  8  9 10