The Existence and Construction of Balanced Incomplete Block Designs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
- On resolvable designs
- Optimal design in irregular BIBD settings
- Linear spaces with many small lines
- Block designs with repeated blocks
- Decompositions of some regular graphs into unicyclic graphs of order five
- On balanced incomplete-block designs with repeated blocks
- A Note on Balanced Incomplete Block Designs
- Minimally projectively embeddable Steiner systems
- On the number of 4-contractible edges in 4-connected graphs
- Edge-coloured designs with block size four
- Drawing Graphs on Few Lines and Few Planes
- Zur Theorie der Steinersysteme
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- Smallest defining sets of directed triple systems
- Resolvable BIBD and SOLS
- Hypercycle systems from semi-parallel classes
- Cyclic balanced incomplete block designs with block size four and arbitrary index
- Almost designs and their links with balanced incomplete block designs
- An infinite class of PBIB designs
- Existence of certain block designs
- Resolvable systems of 8-tuples
- Weak colourings of Kirkman triple systems
- A mathematical programming approach to the construction of BIBDs
- Constant and nearly constant block-sum partially balanced incomplete block designs and magic rectangles
- On 1-rotational \(S_\lambda(2,3,v)\) designs
- On a problem of Erdős on integers, none of which divides the product of k others
- Matroid Designs of Prime Power Index
- A note on balanced incomplete block designs and projective geometry
- scientific article; zbMATH DE number 994562 (Why is no real title available?)
- On the conjugates of an \(n\times 4\) orthogonal array
- Non-isomorphic solutions of group divisible designs with \(k=3\) and \(\lambda_ 1=0\)
- Small embeddings of partial directed triple systems and partial triple systems with even
- A construction of balanced arrays of strength t and some related incomplete block designs
- Brooks-type theorem for \(r\)-hued coloring of graphs
- Self-orthogonal latin squares of all orders 𝑛≠2,3,6
- Group divisible designs with three groups and block size 4
- A Note on a Criterion for a Block Design to be X-1Balanced
- The average degree of minimally contraction-critically 5-connected graphs
- A note on reverse Steiner triple systems
- On the optimality of a class of minimal covering designs
- Twofold triple systems and graph imbeddings
- Group divisible designs with two associate classes: n=2 or m=2
- A structure theory for regular graphs with fixed smallest eigenvalue
- The existence of two pairwise additive \(\mathrm{BIBD}(v, 2, 1)\) for any \(v\)
- Cyclotomy and difference families in elementary Abelian groups
- On complementary decompositions of the complete graph
- On automorphism groups of certain 2-(v,3,2) designs induced by group actions
- Nested group divisible designs and small nested designs
- Constructions and topological invariants of 2-(v,3, ) designs with group actions
- A survey on the existence ofG-Designs
- A subspace covering problem in the n-cube
- Location of outliers in multiple regression using resampled values
- 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
- The design of the century
- Some imbedding theorems for block designs balanced with respect to pairs
- On the construction of perfect deletion-correcting codes using design theory
- f-vectors of pure complexes and pure multicomplexes of rank three
- Zero-sum flows for Steiner systems
- A complete class of balanced incomplete block designs (7, 35, 15, 3, 5) with repeated blocks
- 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
- On resolvable designs. (Reprint)
- Balanced semi-Latin rectangles: properties, existence and constructions for block size two
- Generalized pentagonal geometries
- Construction of skew room squares
- 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\)
- Linear integer programming approach to construction of balanced incomplete block designs
- An explicit formula and its fast algorithm for a class of symmetric balanced incomplete block designs
- A recursive method of construction of resolvable BIB-designs
- A conjecture about BIBDs
- Cycle decompositions of complete multigraphs
- Some new 2-resolvable Steiner quadruple systems
- A new extremal property of Steiner triple-systems
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- r-dynamic colorings and the spectral radius in graphs
- On the E-optimality of a certain class of block designs.
- Balanced ternary designs with block size four
- On the existence of 2-designs S₂(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
- The largest minimum codegree of a 3-graph without a generalized 4-cycle
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Generalized Bhaskar Rao designs
- Generalized Ramsey numbers at the linear and quadratic thresholds
- 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
- Enumeration of small nonisomorphic 1-rotational twofold triple systems
- Theory of division games
- Group divisible designs \(\mathsf{GDD}(n,n,n,2;\lambda_1,\lambda_2)\)
- Improved bounds for group testing designs
- Decomposition of complete graphs into forests with six edges
- The Construction of Optimal Balanced Incomplete Block Designs When Adjacent Observations are Correlated
- Tripelsysteme mit Untersystemen
- Closed trail decompositions of complete equipartite graphs
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)