On some Theorems in Combinatorics Relating to Incomplete Block Designs
From MaRDI portal
Publication:5819799
DOI10.1214/aoms/1177728978zbMath0051.10802MaRDI QIDQ5819799
Publication date: 1953
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177728978
Related Items
Kombinatorische Eigenschaften endlicher Inzidenzstrukturen, Tactical decompositions of designs, Maximal arcs in designs, A survey of some problems in combinatorial designs - a matrix approach, On the nonuniform Fisher inequality, Über die Schnittzahlenmatrix von Blockplänen. (On the intersection number matrix of block designs), 2-designs having an intersection number \(k-n\), Multiplicative designs I: The normal and reducible cases, Distances, graphs and designs, On extremal intersection numbers of a block design, A sharpening of Fisher's inequality, Extension operations for cuts, The \(\lambda\)-designs with multiplicative duals, On the structure of regular pairwise balanced designs, A generalization of Fisher's inequality, Subsets of a finite set that almost always intersect each other in \(\lambda\) elements, Extremal set systems with restricted \(k\)-wise intersections., On the parameters of strongly resolvable designs, On \(\lambda\)-designs, Interlacing eigenvalues and graphs, A property of the hyperplanes of a matroid and an extension of Dilworth's theorem, Geometric matrices and an inequality for (0,1)-matrices, An extension of a theorem of the Bruijn and Erdős on combinatorial designs, Combinatorial designs and related systems, Symmetric designs and related configurations, Intersection properties of finite sets, Incidence matrices and inequalities for combinatorial designs
