On the nonuniform Fisher inequality
From MaRDI portal
Publication:1106859
DOI10.1016/0012-365X(87)90106-3zbMath0652.05043MaRDI QIDQ1106859
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Permutations, words, matrices (05A05)
Related Items (5)
A combinatorial proof of Fisher's inequality ⋮ Laplacian growth, sandpiles, and scaling limits ⋮ Lines in hypergraphs ⋮ Unnamed Item ⋮ The combinatorics of N. G. de Bruijn
Cites Work
- A characterization of type-1 lambda-designs
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- An Inequality for Incidence Matrices
- Square λ-Linked Designs
- A Note on Fisher's Inequality for Balanced Incomplete Block Designs
- A Note on a Combinatorial Problem
- On some Theorems in Combinatorics Relating to Incomplete Block Designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the nonuniform Fisher inequality