Satisfying states of triangulations of a convex \(n\)-gon
The electronic journal of combinatorics, Tome 17 (2010)
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
Mots-clés : Ising model, planar graph, triangulation, perfect matching, satisfying state
@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/}
}
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
Cité par Sources :