Skip to content
BY-NC-ND 4.0 license Open Access Published by De Gruyter Open Access July 25, 2018

Incidence matrices for matchings

  • Murali K. Srinivasan EMAIL logo
From the journal Special Matrices

Abstract

LetM(n) denote the set of all matchings of the complete graph Kn. Set t =[ ]. For 0 ≤ k < l ≤ t−k ≤ t, letM(k, l) denote the incidence matrix of the cardinality k matchings (the rows) vs. the cardinality l matchings (the columns). We show that M(k, l) has full row rank

MSC 2010: 06A07; 06A11

References

[1] Engel, K., Sperner theory. Cambridge University Press (1997).10.1017/CBO9780511574719Search in Google Scholar

[2] Srinivasan, M. K., Symmetric chains, Gelfand-Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme, J. Algebraic Combin. 34, no. 2, 301-322 (2011).Search in Google Scholar

Received: 2018-03-02
Accepted: 2018-06-15
Published Online: 2018-07-25

© 2018 Murali K. Srinivasan, published by De Gruyter

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Downloaded on 29.3.2024 from https://www.degruyter.com/document/doi/10.1515/spma-2018-0024/html
Scroll to top button