An existence theory for pairwise balanced designs. III: Proof of the existence conjectures

From MaRDI portal
Publication:1212936


DOI10.1016/0097-3165(75)90067-9zbMath0295.05002WikidataQ122901388 ScholiaQ122901388MaRDI QIDQ1212936

Richard M. Wilson

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(75)90067-9


05B05: Combinatorial aspects of block designs


Related Items

Constructions of Pairwise-and Variance-Balanced Designs, Existence results for near resolvable designs, On (n, k, l, Δ)-systems, A construction for infinite families of Steiner 3-designs, Candelabra systems and designs, Linear spaces with prime power block sizes, Resolvable perfect cyclic designs, On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays, On the construction of Schroeder quasigroups, The family of t-designs. Part I, Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions, Four pairwise balanced designs, A problem of Zarankiewicz, Twofold triple systems and graph imbeddings, Block designs and graph imbeddings, Perfect cyclic designs, Composition theorems for difference families and regular planes, The spectrum of idempotent varieties of algebras with binary operators based on two variable identities, Finite embedding theorems for partial pairwise balanced designs, On the structure of regular pairwise balanced designs, Strongly regular graphs with smallest eigenvalue -m, The fundamental construction for 3-designs, Some recent developments on BIBDs and related designs, A construction for orthogonal arrays with strength \(t\geq 3\), A powerful method for constructing difference families and optimal optical orthogonal codes, A bound for Wilson's general theorem, Some combinatorial constructions for optical orthogonal codes, Sharpness of some intersection theorems, The set of values of \(b\) for which there exist block designs with \(b\) blocks, \(\mathbb{Z}\)-cyclic ordered triplewhist tournaments on \(p\) elements, where \(p\equiv 5\pmod 8\), Recursive constructions for cyclic BIB designs and their generalizations, A construction for group divisible \(t\)-designs with strength \(t\geqslant 2\) and index unity, A construction for Steiner 3-designs, Decompositions of edge-colored complete graphs, Orthogonal latin square graphs



Cites Work