Boolean designs and self-dual matroids
From MaRDI portal
Publication:1215631
DOI10.1016/0024-3795(75)90003-8zbMATH Open0301.05012OpenAlexW2015403095MaRDI QIDQ1215631FDOQ1215631
Authors: Jack E. Graver
Publication date: 1975
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(75)90003-8
Other designs, configurations (05B30) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
Cited In (13)
- Sharp sets of permutations
- Invertibility of Digraphs and Tournaments
- Almost orthogonal subsets of vector spaces over finite fields
- A short note on supersaturation for oddtown and eventown
- Random packing by matroid bases and triangles
- Two Remarks on Eventown and Oddtown Problems
- Sets with many pairs of orthogonal vectors over finite fields
- Lovász theta approach to eventown problem
- Uniform eventown problems
- On binary identically self-dual matroids
- On subsets with cardinalities of intersections divisible by a fixed integer
- Extremal systems with upper-bounded odd intersections
- Specified intersections
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)