Small Covering Designs by Branch-and-Cut

A Branch-and-Cut algorithm for finding covering designs is presented. Its originality resides in the use of isomorphism pruning of the enumeration tree. A proof that no 4-(10, 5, 1)-covering design with less than 51 sets exists is obtained together with all non isomorphic 4-(10, 5, 1)-covering designs with 51 sets