Geodesic
A note on divisibility of the number of matchings of a family of graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/248
Classification : 05C70, 05A15 
@article{10_37236_248,
     author = {Kyung-Won Hwang and Naeem N. Sheikh and Stephen G. Hartke},
     title = {A note on divisibility of the number of matchings of a family of graphs},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/248},
     zbl = {1188.05097},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/248/}
}
TY  - JOUR
AU  - Kyung-Won Hwang
AU  - Naeem N. Sheikh
AU  - Stephen G. Hartke
TI  - A note on divisibility of the number of matchings of a family of graphs
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/248/
DO  - 10.37236/248
ID  - 10_37236_248
ER  - 
%0 Journal Article
%A Kyung-Won Hwang
%A Naeem N. Sheikh
%A Stephen G. Hartke
%T A note on divisibility of the number of matchings of a family of graphs
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/248/
%R 10.37236/248
%F 10_37236_248
Kyung-Won Hwang; Naeem N. Sheikh; Stephen G. Hartke. A note on divisibility of the number of matchings of a family of graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/248

Cité par Sources :