Maximal rank in matrix spaces via graph matchings

Abstract

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in terms of their maximal rank.

10 pages