scientific article; zbMATH DE number 3104192
From MaRDI portal
zbMath0063.01383MaRDI QIDQ5842949
Publication date: 1940
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Universal hashing and authentication codes, All λ-Designs with Small λ are Type-1, Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs, Subsets of a finite set that almost always intersect each other in \(\lambda\) elements, On the nonuniform Fisher inequality, A note on balanced incomplete block designs and projective geometry, Criteria for the validity of Fisher's condition for balanced block designs, A combinatorial proof of Fisher's inequality, A rank characterization of linear models with nuisance parameters and its application to block designs, On minimum saturated matrices, Groups of projective planes with differing numbers of point and line orbits, More nonexistence results for symmetric pair coverings, A note on the intersection properties of subsets of integers, Fixed block configuration group divisible designs with block size six, On a symmetric representation of Hermitian matrices and its applications to graph theory, Mosaics of combinatorial designs, Uniform hypergraphs under certain intersection constraints between hyperedges, The Cameron-Liebler problem for sets, On the non-existence of pair covering designs with at least as many points as blocks, Characterization of certain balanced \(n\)-ary block designs, Unnamed Item, A survey on the existence ofG-Designs, Almost-Fisher families, Thrackles: An Improved Upper Bound, Switching codes and designs, A sharpening of Fisher's inequality, The cycle switching graph of the Steiner triple systems of order 19 is connected, Almost-Fisher families, Thrackles: an improved upper bound, A generalization of combinatorial designs and related codes, Minimum number of experimental units in connected block designs with certain additional properties, Variations of a combinatorial problem on finite sets, Laplace eigenvalues of graphs---a survey, The de Bruijn-Erdős theorem for hypergraphs, Fractional \(L\)-intersecting families, Some intersection theorems for structures, A lower bound for the number of blocks of \(t - (v,k,\lambda \)) designs with \(t\) odd, Pairwise transitive 2-designs, On the BIB design having the minimum p-rank, On the existence of automorphism free Steiner triple systems, Non-existence d'un 3-design de paramètres \(\lambda=2\), \(k=5\) et \(v=11\), Affine resolvable balanced incomplete block designs: a survey, Balanced colourings of strongly regular graphs, A spectral characterization of the line graph of a BIBD with \(\lambda=1\), The four biplanes with k=9, Improved inequalities for balanced incomplete block designs, Symmetric group divisible designs with the dual property, Special feature: Information theory and statistics, Quasi-residual designs, An investigation of Bhattacharya-type designs, Block intersections in quasiresidual designs, Existence of simple BIBDs from a prime power difference family with minimum index, A generalization of Fisher's inequality, Almost designs and their links with balanced incomplete block designs, Inequalities for t designs, Partial geometric designs from group actions, On some of Jerzy Baksalary's contributions to the theory of block designs, On improving the construction of balanced incomplete block designs using planar near-rings, An Evans-Style Result for Block Designs, A note on the inequality b\(\geq t\) for block designs
