An Inequality for Incidence Matrices

DOI10.2307/2033580MaRDI QIDQ3270912zbMATH OpenOpenAlexFDO

Authors J. R. Isbell

Publication date 1959

Full work available at URL https://doi.org/10.2307/2033580

zbMATH Keywords

foundations of geometry, noneuclidean geometry

Cites work

• Combinatorial Problems

Cited in

(11)

• On the nonuniform Fisher inequality
• Extremal set systems with restricted \(k\)-wise intersections.
• Ranks of matrices with few distinct entries
• A property of the hyperplanes of a matroid and an extension of Dilworth's theorem
• Geometric matrices and an inequality for (0,1)-matrices
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Almost-Fisher families
• Almost-Fisher families
• Uniform hypergraphs under certain intersection constraints between hyperedges
• A new upper bound for codes with a single Hamming distance
• q-analogues of Fisher's inequality and oddtown theorem

This page was built for publication: An Inequality for Incidence Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3270912)