Excess graphs and bicoverings


A bstract The classical bicovering problem seeks to cover all pairs from a v-set by a family F of k-sets so that every pair occurs at least twice and the cardinality of F is minimaL A weight function is introduced for blocks in such a design, and its use in constructing bicoverings is illustrated. A covering is a collection of k-sets (blocks) chosen from… (More)


3 Figures and Tables

Slides referencing similar topics