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
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
© 2018 Murali K. Srinivasan, published by De Gruyter
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.