Almost-Fisher families
From MaRDI portal
Publication:5899503
DOI10.1016/j.jcta.2015.10.003zbMath1326.05161arXiv1408.3496OpenAlexW1490365176MaRDI QIDQ5899503
No author found.
Publication date: 17 November 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.3496
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Extremal set theory (05D05) Other designs, configurations (05B30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finite set-systems whose every intersection is a kernel of a star
- Intersection theorems with geometric consequences
- On t-designs
- Extremal set systems with restricted \(k\)-wise intersections.
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
- Extremal set systems with weakly restricted intersections
- Exact \(k\)-wise intersection theorems
- An Inequality for Incidence Matrices
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Forbidden Intersections
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Almost Intersecting Families of Sets
- Hypergraphs of Bounded Disjointness
- A Note on Fisher's Inequality for Balanced Incomplete Block Designs
- On some Theorems in Combinatorics Relating to Incomplete Block Designs
This page was built for publication: Almost-Fisher families