Incidence matrices for matchings
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
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2018-07-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2018-0024 |