The Existence and Construction of Balanced Incomplete Block Designs

DOI10.1214/AOMS/1177705047zbMATH Open0107.36102OpenAlexW2034645676WikidataQ106884305 ScholiaQ106884305MaRDI QIDQ3294602FDOQ3294602

Authors: Haim Hanani 

Publication date: 1961

Published in: Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoms/1177705047

zbMATH Keywords

balanced incomplete block designs

Mathematics Subject Classification ID

Statistical block designs (62K10) Combinatorial aspects of block designs (05B05)

Cited In (only showing first 100 items - show all)

• \(f\)-vectors of pure complexes and pure multicomplexes of rank three
• Block designs with repeated blocks and \((b,r,\lambda)=1\)
• Decompositions of complete multigraphs into cycles of varying lengths
• Cyclic block designs with block size 3
• Cycle decompositions of complete multigraphs
• Balanced semi-Latin rectangles: properties, existence and constructions for block size two
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• Some new 2-resolvable Steiner quadruple systems
• A new extremal property of Steiner triple-systems
• Balanced ternary designs with block size four
• On the existence of 2-designs S\(_2\)(2,3,v) without repeated blocks
• Cyclic Mendelsohn triple systems with a cyclic resolution or a cyclic almost resolution
• The completely symmetric designs with blocksize three
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Generalized Bhaskar Rao designs
• Optimal packings of \(K_4\)'s into a \(K_n\)
• On the existence of super-simple designs with block size 4
• Embedding partial triple systems
• On resolvable balanced incomplete block designs
• Theory of division games
• The Construction of Optimal Balanced Incomplete Block Designs When Adjacent Observations are Correlated
• Closed trail decompositions of complete equipartite graphs
• Cycle decompositions of complete multigraphs
• Some balanced incomplete block designs
• On the combinatorial problems which I would most like to see solved
• Infinite families of 2-designs and 3-designs from linear codes
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• The fundamental construction for 3-designs
• The maximum size of hypergraphs without generalized 4-cycles
• On balanced incomplete block designs with blocks having five elements
• On the Block Structure of Certain Partially Balanced Incomplete Block Designs
• Four pairwise balanced designs
• Coding techniques for handling failures in large disk arrays
• More balanced ternary designs with block size four
• Another class of balanced graph designs: Balanced circuit designs
• Blocking sets in designs with block size 4
• On the (15,5,\(\lambda\) )-family of BIBDs
• On the construction and existence of a certain class of complete diallel cross designs
• Zero-sum flows for triple systems
• On conjectures of Berge and Chvátal
• On the covering of pairs by quadruples. I
• On the covering of pairs by quadruples. II
• The family of t-designs. Part I
• Optimality and construction of nested row and column designs
• Simple constructions for balanced incomplete block designs with block size three
• Minimum matrix representation of closure operations
• On complete arcs in Steiner systems S(2,3,v) and S(2,4,v)
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Embeddings of Steiner triple systems
• Tactical constructions
• Balanced incomplete block designs and related designs
• Non-group gradings on simple Lie algebras
• Existence and constructions of 2-designs S\(_3\)(2,3,v) without repeated blocks
• Balanced bipartite weighing designs
• On resolvable designs
• Optimal design in irregular BIBD settings
• Block designs with repeated blocks
• On balanced incomplete-block designs with repeated blocks
• Edge-coloured designs with block size four
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Almost designs and their links with balanced incomplete block designs
• A mathematical programming approach to the construction of BIBDs
• Existence of certain block designs
• Resolvable systems of 8-tuples
• On a problem of Erdős on integers, none of which divides the product of \(k\) others
• Self-orthogonal latin squares of all orders 𝑛≠2,3,6
• Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\)
• Twofold triple systems and graph imbeddings
• A note on reverse Steiner triple systems
• On the optimality of a class of minimal covering designs
• Cyclotomy and difference families in elementary Abelian groups
• Group divisible designs with two associate classes: \(n=2\) or \(m=2\)
• A survey on the existence ofG-Designs
• On complementary decompositions of the complete graph
• A subspace covering problem in the \(n\)-cube
• Generalised Bhaskar Rao designs over non-Abelian groups
• Model robust optimal designs for comparing test treatments with a control
• Cyclic block designs with block size 3 from Skolem-type sequences
• On the construction of perfect deletion-correcting codes using design theory
• Zero-sum flows for Steiner systems
• A complete class of balanced incomplete block designs \(\beta (7, 35, 15, 3, 5)\) with repeated blocks
• Generalized pentagonal geometries
• Linear integer programming approach to construction of balanced incomplete block designs
• On resolvable designs. (Reprint)
• 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\)
• An explicit formula and its fast algorithm for a class of symmetric balanced incomplete block designs
• A conjecture about BIBDs
• Construction of skew room squares
• A recursive method of construction of resolvable BIB-designs
• On the E-optimality of a certain class of block designs.
• The largest minimum codegree of a 3-graph without a generalized 4-cycle
• Enumeration of small nonisomorphic 1-rotational twofold triple systems
• Improved bounds for group testing designs
• Tripelsysteme mit Untersystemen
• Constructing block designs of elements or residue rings with a composite modulus
• Multicolor Ramsey numbers for triple systems
• Triangle decompositions of \(\lambda K_v - \lambda K_w - \lambda K_u\)
• Stein quasigroups I: Combinatorial aspects
• The existence of cyclic \(\mathrm{BIBD}(v,4,\lambda)\) -- a survey and new results
• Certain recurrent and asymptotic estimates in the covering problem

This page was built for publication: The Existence and Construction of Balanced Incomplete Block Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3294602)