A note on divisibility of the number of matchings of a family of graphs

MaRDI QIDQ1028802zbMATH OpenFDO

Authors Kyung-Won Hwang, Naeem N. Sheikh, Stephen G. Hartke

Publication date 8 July 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117494, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1n10.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

Summary: For a certain graph obtained by adding extra vertices and edges to the triangular lattice graph, Propp conjectured that the number of perfect matchings of such a graph is always divisible by 3. In this note we prove this conjecture.

Recommendations

• Generalizing the divisibility property of rectangle domino tilings
• The number of perfect matchings in two types of 3-regular graphs
• Perfect matchings and perfect powers
• scientific article; zbMATH DE number 1405497
• The number of the perfect matchings for three specific types of graphs

Cited in

(1)

• On families with bounded matching number

This page was built for publication: A note on divisibility of the number of matchings of a family of graphs

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