Exact k-wise intersection theorems
From MaRDI portal
Publication:2484160
Recommendations
- Intersection theorems under dimension constraints
- On dual versions of Krull's intersection theorem
- scientific article; zbMATH DE number 650865
- More complete intersection theorems
- Around the complete intersection theorem
- A STRUCTURE THEOREM FOR COMPLETE INTERSECTIONS
- scientific article; zbMATH DE number 62384
- scientific article; zbMATH DE number 4210195
- scientific article; zbMATH DE number 939034
- scientific article; zbMATH DE number 4242
Cited in
(15)- On the FKB conjecture for disjoint intersections
- Extremal set systems with weakly restricted intersections
- Tight bounds for Katona's shadow intersection theorem
- A note on k-wise oddtown problems
- Ryser's conjecture for \(t\)-intersecting hypergraphs
- Improved bounds on families under \(k\)-wise set-intersection constraints
- Two remarks on eventown and oddtown problems
- Uniform eventown problems
- A note on saturation for k-wise intersecting families
- Almost-Fisher families
- Almost-Fisher families
- A short note on supersaturation for oddtown and eventown
- On supersaturation for oddtown and eventown
- q-analogues of Fisher's inequality and oddtown theorem
- Extremal problems whose solutions are the blowups of the small Witt- designs
This page was built for publication: Exact \(k\)-wise intersection theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484160)