Combinatorial Properties of Group Divisible Incomplete Block Designs
From MaRDI portal
Publication:5812579
DOI10.1214/aoms/1177729382zbMath0047.12902OpenAlexW2042207646MaRDI QIDQ5812579
No author found.
Publication date: 1952
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177729382
Related Items (79)
A survey of some problems in combinatorial designs - a matrix approach ⋮ Clique partitions of the cocktail party graph ⋮ Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices) ⋮ Semiregular group divisible designs with dual properties ⋮ Regular graphs with girth at least 5 and small second largest eigenvalue ⋮ On a class of almost perfect sequences ⋮ Spectra of Deza graphs ⋮ A necessary condition for the existence of regular and symmetrical PBIB designs of \(T_ 3\) type ⋮ Inequalities for quasisymmetric designs ⋮ New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs ⋮ Marginal proportional frequency arrays of order 2 ⋮ Über die Schnittzahlenmatrix von Blockplänen. (On the intersection number matrix of block designs) ⋮ New constructions of group divisible designs ⋮ Embedding of orthogonal arrays of strength two and deficiency greater than two ⋮ More nonexistence results for symmetric pair coverings ⋮ An elliptic semiplane ⋮ On a class of partially balanced incomplete block designs ⋮ Multi-part balanced incomplete-block designs ⋮ Partitioned difference families: the storm has not yet passed ⋮ Self-dual codes from quotient matrices of symmetric divisible designs with the dual property ⋮ Variants of Cyclic Difference Sets ⋮ On the non-existence of pair covering designs with at least as many points as blocks ⋮ Invariants of quadratic forms and applications in design theory ⋮ Partial geometric designs having circulant concurrence matrices ⋮ Divisible design graphs ⋮ Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs ⋮ Multiplier theorems ⋮ PBIB-designs and association schemes arising from minimum bi-connected dominating sets of hypercubes ⋮ On existence of dual property in symmetric group divisible designs ⋮ Generalized relative difference sets and partially balanced incomplete block designs ⋮ Divisible difference sets with multiplier -1 ⋮ Translation divisible designs ⋮ Relative addition sets and partially balanced incomplete block designs ⋮ Polya enumeration of expansions of resolvable incidence structures ⋮ Necessary conditions for the existence of divisible designs ⋮ A contraction of square transversal designs ⋮ The Mann test for divisible difference sets ⋮ A rational congruence for a standard orbit decomposition ⋮ On the line structure of designs ⋮ Symmetric divisible designs with \(k-\lambda{}_ 1=1\) ⋮ Some constructions of group divisible designs with Singer groups ⋮ Semi-regular divisible designs and Frobenius groups ⋮ On a class of partial planes related to biplanes ⋮ Generalising Fisher's inequality to coverings and packings ⋮ Some nonexistence results on generalized difference sets ⋮ New constructions of divisible designs ⋮ Distance regular covers of the complete graph ⋮ Maximal arcs and group divisible designs ⋮ Tactical constructions ⋮ Affine resolvable balanced incomplete block designs: a survey ⋮ Conditions for singular incidence matrices ⋮ New results on GDDs, covering, packing and directable designs with block size 5 ⋮ Special partially balanced incomplete block designs and associated graphs ⋮ Fisher's inequality for designs on regular graphs ⋮ Characterization of certain incomplete block designs ⋮ Symmetric group divisible designs with the dual property ⋮ The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks ⋮ On divisible design Cayley graphs ⋮ A construction method for point divisible designs ⋮ The family of block designs with some combinatorial properties ⋮ On the non-existence of a class of symmetric group divisible partial designs ⋮ Spreads and group divisible designs ⋮ On the orbits of collineation groups ⋮ On construction of balanced \(n\)-ary block designs ⋮ Geometric and pseudo-geometric graphs \((q^ 2 + 1,q + 1,1)\) ⋮ Some results on generalized difference sets ⋮ On divisible difference sets which are fixed by the inverse ⋮ On bipartite graphs of diameter 3 and defect 2 ⋮ New results on modular Golomb rulers, optical orthogonal codes and related structures ⋮ Connectedness of two-associate PBIB designs ⋮ On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler ⋮ Three-class association schemes ⋮ Subsets of a finite set that intersect each other in at most one element ⋮ Some techniques for constructing infinite families of BIBD's ⋮ A structural classification of SR group divisible designs ⋮ Square divisible designs with \(k=(n+1)_{\mu}\) ⋮ Existence and colouring of configurations with line size ⋮ On the structure of Abelian groups admitting divisible difference sets ⋮ Mosaics of combinatorial designs for information-theoretic security
This page was built for publication: Combinatorial Properties of Group Divisible Incomplete Block Designs