On the existence of one-sided designs

Abstract

A collection of subsets (called blocks) of a fixed vertex set (possibly with repetition) is called a (t n , t n −1, ..., t 1; a m , a m −1, ..., a 1)-design if it satisfies certain regularity conditions on the number of blocks which contain subsets of the vertex set of certain size, and other regularity conditions on the size of the intersections of certain numbers of the blocks. (For example, a BIBD (or (b, v, r, k, λ)-configuration) is a (1, 2; 1)-design, and a t-design is a (t, t−1, ..., 1; 1)-design.) A design has design-type (t n , ..., t 1; a m , ..., a 1) if it satisfies only those conditions. A one-sided design is a design with design-type (t n , ..., t 1;) or (;a m , ..., a 1). In this paper we show, by construction, that any one-sided design-type is possible.