The 2-matching lattice of a graph

DOI10.1016/0095-8956(89)90046-4MaRDI QIDQ1124612zbMATH OpenOpenAlexFDO

Authors Dieter Jungnickel, Matthias Leclerc

Publication date 1989

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(89)90046-4

zbMATH Keywords

graphlatticeperfect 2-matchingsperfect matchings

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Varieties of lattices (06B20)

Review text

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.

Recommendations

• Matching structure and the matching lattice
• scientific article; zbMATH DE number 15371
• scientific article; zbMATH DE number 1944136
• Perfect matchings in the triangular lattice
• Matchings in Lattice Graphs and Hamming Graphs

Cites work

• scientific article; zbMATH DE number 3904331 (Why is no real title available?)
• scientific article; zbMATH DE number 4047093 (Why is no real title available?)
• Matching structure and the matching lattice
• Matching theory

Cited in

(3)

• scientific article; zbMATH DE number 1944136 (Why is no real title available?)
• scientific article; zbMATH DE number 812089 (Why is no real title available?)
• Two-lattice polyhedra: Duality and extreme points

This page was built for publication: The 2-matching lattice of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124612)