A note on divisibility of the number of matchings of a family of graphs (Q1028802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on divisibility of the number of matchings of a family of graphs |
scientific article; zbMATH DE number 5576410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on divisibility of the number of matchings of a family of graphs |
scientific article; zbMATH DE number 5576410 |
Statements
A note on divisibility of the number of matchings of a family of graphs (English)
0 references
8 July 2009
0 references
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.
0 references
0.7893490195274353
0 references
0.7876308560371399
0 references
0.7703246474266052
0 references
0.768367350101471
0 references
