On maximal isolation sets in the uniform intersection matrix

zbMath1444.05032arXiv1907.11632MaRDI QIDQ3300704

Michal Parnas, Adi Shraibman

Publication date: 29 July 2020

Full work available at URL: https://arxiv.org/abs/1907.11632

zbMATH Keywords

Boolean rank of a matrixmaximal identity submatrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Boolean and Hadamard matrices (15B34)

Related Items (1)

Circulant almost cross intersecting families

Cites Work

• Isolation number versus Boolean rank
• Kneser's conjecture, chromatic number, and homotopy
• Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
• An extremal problem for two families of sets
• The Boolean rank of the uniform intersection matrix and a family of its submatrices
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Communication Complexity
• On generalized graphs
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: On maximal isolation sets in the uniform intersection matrix