Geometric matrices and an inequality for (0,1)-matrices
From MaRDI portal
Publication:2277472
Recommendations
Cites work
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- An Inequality for Incidence Matrices
- Combinatorial Problems
- scientific article; zbMATH DE number 3113224 (Why is no real title available?)
- scientific article; zbMATH DE number 3596864 (Why is no real title available?)
- scientific article; zbMATH DE number 3234131 (Why is no real title available?)
- scientific article; zbMATH DE number 3251194 (Why is no real title available?)
- scientific article; zbMATH DE number 3254630 (Why is no real title available?)
- On some Theorems in Combinatorics Relating to Incomplete Block Designs
- On the Number of Ordinary Lines Determined by n Points
- Square λ-Linked Designs
- Subsets of a finite set that intersect each other in at most one element
- The Nonexistence of Certain Finite Projective Planes
Cited in
(7)- Root systems and optimal block designs
- Matrix scaling: A geometric proof of Sinkhorn's theorem
- On inequalities for the parameters of combinatorial matrices of a special form
- Lines in hypergraphs
- scientific article; zbMATH DE number 1187140 (Why is no real title available?)
- Exact bounds for \((\lambda,n)\)-stable 0-1 matrices.
- Geometries of Matrices. I 1 Arithmetical Construction
This page was built for publication: Geometric matrices and an inequality for (0,1)-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277472)