Satisfying States of Triangulations of a Convex $n$-gon

  • A. Jiménez
  • M. Kiwi
  • M. Loebl
DOI: https://doi.org/10.37236/311

Abstract

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.

Published
2010-03-08
How to Cite
Jiménez, A., Kiwi, M., & Loebl, M. (2010). Satisfying States of Triangulations of a Convex $n$-gon. The Electronic Journal of Combinatorics, 17(1), R39. https://doi.org/10.37236/311
Issue
Volume 17 (2010)
Article Number
R39