On some Theorems in Combinatorics Relating to Incomplete Block Designs
From MaRDI portal
Cited in
(38)- 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 -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 elements
- Extremal set systems with restricted \(k\)-wise intersections.
- Ranks of matrices with few distinct entries
- On the parameters of strongly resolvable designs
- On -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
- A combinatorial proof of Fisher's inequality
- Incidence matrices and inequalities for combinatorial designs
- Flag-transitive point-primitive automorphism groups of nonsymmetric 2-(v,k,2) designs
- Low coherence unit norm tight frames
- Almost-Fisher families
- Almost-Fisher families
- Uniform hypergraphs under certain intersection constraints between hyperedges
- On quasi-symmetric designs with intersection difference three
- A new upper bound for codes with a single Hamming distance
- On some \(\boldsymbol{\Sigma}^B_0\)-formulae generalizing counting principles over \(V^0\)
- q-analogues of Fisher's inequality and oddtown theorem
- Kombinatorische Eigenschaften endlicher Inzidenzstrukturen
This page was built for publication: On some Theorems in Combinatorics Relating to Incomplete Block Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5819799)