Geometric matrices and an inequality for (0,1)-matrices

DOI10.1016/0012-365X(90)90207-XzbMath0725.05024OpenAlexW2064633401MaRDI QIDQ2277472

Lewis E. Varga

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90207-x

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (1)

Lines in hypergraphs

Cites Work

• Subsets of a finite set that intersect each other in at most one element
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• On the Number of Ordinary Lines Determined by n Points
• An Inequality for Incidence Matrices
• Square λ-Linked Designs
• Combinatorial Problems
• The Nonexistence of Certain Finite Projective Planes
• On some Theorems in Combinatorics Relating to Incomplete Block Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Geometric matrices and an inequality for (0,1)-matrices