Properties of (0,1)-matrices with no triangles

DOI10.1016/0097-3165(80)90008-4zbMath0519.05011OpenAlexW2082656189MaRDI QIDQ1054733

Richard P. Anstee

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(80)90008-4

zbMATH Keywords

(0,1)-matricesdistinct columnslinearly independent row intersections

Mathematics Subject Classification ID

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

Related Items (19)

General forbidden configuration theorems ⋮ Hypergraphs with no special cycles ⋮ A forbidden configuration theorem of Alon ⋮ Shattering-extremal set systems of small VC-dimension ⋮ Graphs and degree sequences. I ⋮ A canonical decomposition theory for metrics on a finite set ⋮ Exact bounds for (λ,n)–stable 0-1 matrices. ⋮ Forbidden configurations, discrepancy and determinants ⋮ Shattering-extremal set systems from Sperner families ⋮ A characterization of \((\lambda,2)\)-stable (0,1) matrices ⋮ Quasi-ultrametrics and their \(2\)-ball hypergraphs ⋮ A class of hypergraphs satisfying an inequality of Lovasz ⋮ Characterizations of strongly chordal graphs ⋮ Matrices and set differences ⋮ The network flows approach for matrices with given row and column sums ⋮ Properties of (0,1)-matrices without certain configurations ⋮ Graphs whose neighborhoods have no special cycles ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Hypergraphs without a large star

Cites Work

• Unnamed Item
• Unnamed Item
• Incidence matrices and interval graphs
• Permanent of the direct product of matrices
• Intersection properties of finite sets
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees
• Combinatorial Configurations
• A Fundamental Matrix Equation for Finite Sets

This page was built for publication: Properties of (0,1)-matrices with no triangles