The 2-matching lattice of a graph (Q1124612)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The 2-matching lattice of a graph |
scientific article |
Statements
The 2-matching lattice of a graph (English)
0 references
1989
0 references
Let L2M(G) be the lattice generated by the perfect 2-matchings of a graph G with \(2^ ab\), b odd, vertices, and let Lin 2M(G) be the linear subspace of \(R^ E\) generated by the perfect matchings of G. Clearly \(L2M(G)\leq Lin 2M(G).\) The result of this note is that a vector x in Lin 2M(G) is in L2M(G) iff the coordinate sum of x is divisible by \(2^ a\). This result is an analogy of a result of Lovász about perfect matchings in a graph.
0 references
lattice
0 references
perfect 2-matchings
0 references
graph
0 references
perfect matchings
0 references