Incidence matrices for matchings
Srinivasan Murali K.
Special Matrices · 2018
doi:10.1515/spma-2018-0024 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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
Abstract licence: CC BY-NC-ND
References3
3 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.