A combinatorial proof of Fisher's inequality

DOI10.1007/s00373-020-02205-5zbMath1459.05025arXiv2003.06286OpenAlexW3037947048MaRDI QIDQ2657061

Rogers Mathew, Tapas Kumar Mishra

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.06286

zbMATH Keywords

extremal set theoryblock designintersecting families

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Balancing matrices with line shifts
• On the nonuniform Fisher inequality
• ``Integer-making theorems
• A counting proof of the Graham-Pollak theorem
• On Some Applications of Diophantine Approximations
• A Note on Fisher's Inequality for Balanced Incomplete Block Designs
• On some Theorems in Combinatorics Relating to Incomplete Block Designs
• A note on Fisher's inequality

This page was built for publication: A combinatorial proof of Fisher's inequality