arXiv:1703.05551 Abstract | arXiv Analytics

arXiv:1703.05551 [math.CO]Abstract References Reviews Resources

Maximal rank in matrix spaces via graph matchings

Published 2017-03-16Version 1

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.

Comments: 10 pages

Categories: math.CO

Subjects: 05C50, 47L05

Keywords: maximal rank, matrix spaces, graph matchings, upper bounds, simple proofs

Related articles: Most relevant | Search more

arXiv:1310.3786 [math.CO] (Published 2013-10-14, updated 2016-03-31)

On Ramsey numbers of complete graphs with dropped stars

Jonathan Chappelon, Luis Pedro Montejano, Jorge Ramírez Alfonsín

arXiv:math/0609425 [math.CO] (Published 2006-09-14)

Upper Bounds on the Automorphism Group of a Graph

Ilia Krasikov, Arie Lev, Bhalchandra D. Thatte

arXiv:1011.3347 [math.CO] (Published 2010-11-15, updated 2011-05-23)