Incidence matrices for matchings

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

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Special matrices 2018-07, Vol.6 (1), p.297-300
1. Verfasser: Srinivasan, Murali K.
Format: Artikel
Sprache:eng
Schlagworte:
06A07
06A11
incidence matrices
matchings
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
ISSN:2300-7451
2300-7451
DOI:10.1515/spma-2018-0024