scientific article; zbMATH DE number 3104192

Cited in

(71)

A note on the inequality b\(\geq t\) for block designs
On the nonuniform Fisher inequality
Criteria for the validity of Fisher's condition for balanced block designs
A rank characterization of linear models with nuisance parameters and its application to block designs
A note on the intersection properties of subsets of integers
Characterization of certain balanced n-ary block designs
A sharpening of Fisher's inequality
Minimum number of experimental units in connected block designs with certain additional properties
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 =2, k=5 et v=11
Affine resolvable balanced incomplete block designs: a survey
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
A generalization of Fisher's inequality
Universal hashing and authentication codes
Subsets of a finite set that almost always intersect each other in elements
Mosaics of combinatorial designs
Thrackles: an improved upper bound
Balanced colourings of strongly regular graphs
Inequalities for t designs
Fractional L-intersecting families
Pairwise transitive 2-designs
Special feature: Information theory and statistics
Almost designs and their links with balanced incomplete block designs
Partial geometric designs from group actions
On the non-existence of pair covering designs with at least as many points as blocks
Variations of a combinatorial problem on finite sets
Quasi-residual designs
An investigation of Bhattacharya-type designs
Block intersections in quasiresidual designs
On some of Jerzy Baksalary's contributions to the theory of block designs
Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
A combinatorial proof of Fisher's inequality
All -designs with small are type-1
A survey on the existence ofG-Designs
On minimum saturated matrices
Groups of projective planes with differing numbers of point and line orbits
Fixed block configuration group divisible designs with block size six
Thrackles: an improved upper bound
An Evans-style result for block designs
A note on balanced incomplete block designs and projective geometry
A generalization of combinatorial designs and related codes
Existence of simple BIBDs from a prime power difference family with minimum index
A lower bound for the number of blocks of t - (v,k, ) designs with t odd
On improving the construction of balanced incomplete block designs using planar near-rings
Triangles and circles in infinite dimension
Almost-Fisher families
Almost-Fisher families
Some intersection theorems for structures
Fishers_Inequality
Uniform hypergraphs under certain intersection constraints between hyperedges
New lower bounds for \(t\)-coverings
Switching codes and designs
The cycle switching graph of the Steiner triple systems of order 19 is connected
Latin squares at Rothamsted in the time of Fisher and Yates
The construction of optimal orthogonal arrays with repeated rows and strength 2
Laplace eigenvalues of graphs---a survey
On supersaturation for oddtown and eventown
The de Bruijn-Erdős theorem for hypergraphs
Bounded fractional intersecting families are linear in size
Bounds for asymmetric nested orthogonal arrays
On some \(\boldsymbol{\Sigma}^B_0\)-formulae generalizing counting principles over \(V^0\)
q-analogues of Fisher's inequality and oddtown theorem
Geometrical approach for construction of balanced incomplete block design
Combining the theorems of Turán and de Bruijn-Erdős
More nonexistence results for symmetric pair coverings
On a symmetric representation of Hermitian matrices and its applications to graph theory
The Cameron-Liebler problem for sets

This page was built for publication:

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