Geodesic
Satisfying states of triangulations of a convex \(n\)-gon
The electronic journal of combinatorics, Tome 17 (2010)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
In this work we count the number of satisfying states of triangulations of a convex $n$-gon using the transfer matrix method. We show an exponential (in $n$) lower bound. We also give the exact formula for the number of satisfying states of a strip of triangles.
DOI : 10.37236/311
Classification : 05C30, 05C70
Mots-clés : Ising model, planar graph, triangulation, perfect matching, satisfying state 
A. Jiménez; M. Kiwi; M. Loebl. Satisfying states of triangulations of a convex \(n\)-gon. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/311
@article{10_37236_311,
     author = {A. Jim\'enez and M. Kiwi and M. Loebl},
     title = {Satisfying states of triangulations of a convex \(n\)-gon},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/311},
     zbl = {1207.05090},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/311/}
}
TY  - JOUR
AU  - A. Jiménez
AU  - M. Kiwi
AU  - M. Loebl
TI  - Satisfying states of triangulations of a convex \(n\)-gon
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/311/
DO  - 10.37236/311
ID  - 10_37236_311
ER  - 
%0 Journal Article
%A A. Jiménez
%A M. Kiwi
%A M. Loebl
%T Satisfying states of triangulations of a convex \(n\)-gon
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/311/
%R 10.37236/311
%F 10_37236_311

Cité par Sources :