The Existence and Construction of Balanced Incomplete Block Designs
From MaRDI portal
Publication:3294602
DOI10.1214/AOMS/1177705047zbMath0107.36102OpenAlexW2034645676WikidataQ106884305 ScholiaQ106884305MaRDI QIDQ3294602
Publication date: 1961
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177705047
Related Items (only showing first 100 items - show all)
Extremal problems in relational data bases ⋮ On complete arcs in Steiner systems S(2,3,v) and S(2,4,v) ⋮ On balanced incomplete-block designs with repeated blocks ⋮ A note on balanced incomplete block designs and projective geometry ⋮ 5-Shredders of Contraction-Critical 5-Connected Graphs ⋮ Location of outliers in multiple regression using resampled values ⋮ Non-group gradings on simple Lie algebras ⋮ Enumeration of small nonisomorphic 1-rotational twofold triple systems ⋮ Existence Theorems for Matroid Designs ⋮ Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ Brooks-type theorem for \(r\)-hued coloring of graphs ⋮ A survey on the existence ofG-Designs ⋮ Unnamed Item ⋮ Designs for graphs with six vertices and ten edges -- II ⋮ A mathematical programming approach to the construction of BIBDs ⋮ Generalized pentagonal geometries ⋮ THE EXISTENCE OF CYCLIC {\rm BIBD}(v,4,\lambda)- A SURVEY AND NEW RESULTS ⋮ The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle ⋮ The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs ⋮ Closed trail decompositions of complete equipartite graphs ⋮ Self-orthogonal latin squares of all orders 𝑛≠2,3,6 ⋮ The design of the century ⋮ Stein quasigroups I: Combinatorial aspects ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Generalized pentagonal geometries. II ⋮ An infinite class of PBIB designs ⋮ Hypercycle systems from semi-parallel classes ⋮ Cycle decompositions of complete multigraphs ⋮ A Conjecture about BIBDs ⋮ Cycle decompositions of complete multigraphs ⋮ Designs for graphs with six vertices and ten edges ⋮ Improved bounds for group testing designs ⋮ Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs ⋮ Linear spaces with many small lines ⋮ Balanced semi-Latin rectangles: properties, existence and constructions for block size two ⋮ Coding techniques for handling failures in large disk arrays ⋮ Constructions and topological invariants of 2-(v,3,\(\lambda\) ) designs with group actions ⋮ Model robust optimal designs for comparing test treatments with a control ⋮ On the construction of perfect deletion-correcting codes using design theory ⋮ The existence of cyclic \((v, 4, 1)\)-designs ⋮ Non-isomorphic solutions of group divisible designs with \(k=3\) and \(\lambda_ 1=0\) ⋮ Edge-coloured designs with block size four ⋮ Embedding partial triple systems ⋮ On the construction and existence of a certain class of complete diallel cross designs ⋮ On the existence of super-simple designs with block size 4 ⋮ On complementary decompositions of the complete graph ⋮ Robust procedures in multiple regression: \(p\)-subsets and a computational proposal ⋮ \(E\)-optimal design in irregular BIBD settings ⋮ Triangle decompositions of \(\lambda K_v - \lambda K_w - \lambda K_u\) ⋮ \(f\)-vectors of pure complexes and pure multicomplexes of rank three ⋮ On the existence of 2-designs S\(_2\)(2,3,v) without repeated blocks ⋮ Tripelsysteme mit Untersystemen ⋮ Certain recurrent and asymptotic estimates in the covering problem ⋮ Cyclic block designs with block size 3 from Skolem-type sequences ⋮ The family of t-designs. Part I ⋮ Zero-sum flows for Steiner systems ⋮ Cyclic block designs with block size 3 ⋮ Multicolor Ramsey numbers for triple systems ⋮ Minimally projectively embeddable Steiner systems ⋮ On the combinatorial problems which I would most like to see solved ⋮ On the E-optimality of a certain class of block designs. ⋮ On the existence of 2-designs Slambda(2,3,v) without repeated blocks ⋮ Four pairwise balanced designs ⋮ A subspace covering problem in the \(n\)-cube ⋮ Decompositions of complete multigraphs into cycles of varying lengths ⋮ A complete class of balanced incomplete block designs \(\beta (7, 35, 15, 3, 5)\) with repeated blocks ⋮ Optimality and construction of nested row and column designs ⋮ Balanced ternary designs with block size four ⋮ The completely symmetric designs with blocksize three ⋮ Cyclic Mendelsohn triple systems with a cyclic resolution or a cyclic almost resolution ⋮ Optimal design in irregular BIBD settings ⋮ An existence theory for pairwise balanced designs. III: Proof of the existence conjectures ⋮ Twofold triple systems and graph imbeddings ⋮ On resolvable balanced incomplete block designs ⋮ Infinite families of 2-designs and 3-designs from linear codes ⋮ Another class of balanced graph designs: Balanced circuit designs ⋮ Tactical constructions ⋮ Zur Theorie der Steinersysteme ⋮ A lower bound for v in a \(t-(v,k,\lambda)\) design ⋮ On resolvable designs. (Reprint) ⋮ Balanced bipartite weighing designs ⋮ Some imbedding theorems for block designs balanced with respect to pairs ⋮ More balanced ternary designs with block size four ⋮ Constructing block designs of elements or residue rings with a composite modulus ⋮ Balanced incomplete block designs and related designs ⋮ On the conjugates of an \(n\times 4\) orthogonal array ⋮ Construction of skew room squares ⋮ \(G\)-decomposition of \(K_n\), where G has four vertices or less ⋮ Zero-sum flows for triple systems ⋮ Matroid Designs of Prime Power Index ⋮ 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\) ⋮ Theory of division games ⋮ A recursive method of construction of resolvable BIB-designs ⋮ The spectrum problem for the connected cubic graphs of order 10 ⋮ On the number of 4-contractible edges in 4-connected graphs ⋮ Optimal packings of \(K_4\)'s into a \(K_n\) ⋮ Blocking sets in designs with block size 4 ⋮ Group divisible designs with two associate classes: \(n=2\) or \(m=2\) ⋮ The maximum size of hypergraphs without generalized 4-cycles
This page was built for publication: The Existence and Construction of Balanced Incomplete Block Designs
