Maximal rank in matrix spaces via graph matchings

DOI10.1016/j.laa.2017.04.016zbMath1366.05082arXiv1703.05551OpenAlexW2601826201MaRDI QIDQ2361549

Roy Meshulam

Publication date: 30 June 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

graph matchingspaces of matrices of bounded rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear spaces of operators (47L05)

Related Items

Maximal generalized rank in graphical matrix spaces, Sinkhorn-Knopp theorem for PPT states

Cites Work

• Unnamed Item
• Unnamed Item
• Affine spaces of symmetric or alternating matrices with bounded rank
• On two extremal matrix problems
• Combinatorial Nullstellensatz
• Spaces of \(p\)-vectors of bounded rank