Boolean designs and self-dual matroids
From MaRDI portal
Cites work
Cited in
(17)- Sharp sets of permutations
- Extremal systems with upper-bounded odd intersections
- Random packing by matroid bases and triangles
- Lovász theta approach to eventown problem
- Almost orthogonal subsets of vector spaces over finite fields
- Specified intersections
- Two remarks on eventown and oddtown problems
- Uniform eventown problems
- On subsets with cardinalities of intersections divisible by a fixed integer
- Invertibility of Digraphs and Tournaments
- A short note on supersaturation for oddtown and eventown
- Kneser's theorem for codes and -divisible set families
- On supersaturation for oddtown and eventown
- On set systems with strongly restricted intersections
- q-analogues of Fisher's inequality and oddtown theorem
- On binary identically self-dual matroids
- Sets with many pairs of orthogonal vectors over finite fields
This page was built for publication: Boolean designs and self-dual matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1215631)