Possible Duplicate:
Explanation/Intuition behind why $C_n$ counts the number of triangulations of a convex $n+2$-gon?
I am interested in counting of how many distinct triangulation are there of a convex polygon of n vertices.
Of course it should be a function of n.
If you have a link to appropriate preferably simple paper, I'll appreciate sharing it with us.
Thanks!