Covering designs on 13 blocks revisited

Authors

  • Greig M.
  • Li P.C.
  • Van Rees G.H.J.

Abstract

A (v, k, t)-Covering Design is a set of k-subsets of a set of v elements such that every set of t elements occurs in at least one block. The minimum number of blocks in any such design is denoted by C(v, k, t). We find all v and k so that C(v, k, 2) = 13 and give all the details and proofs. Further, we determine that C(28, 9, 2) = C(41, 13, 2) = 14.

Published

2006-06-09

How to Cite

Greig M., Li P.C., & Van Rees G.H.J. (2006). Covering designs on 13 blocks revisited. Utilitas Mathematica, 70. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/419

Issue

Vol. 70 (2006): Volume 70, 2006

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.