Unformatted text preview: n-gon as the base, and let u n be the number of triangulations with in which a side other than the base has been marked. Let v n be the number of triangulations in which one of the edges of the triangulation (either a diagonal or a side, including the base) has been turned into an arrow. Show that u n = ( n-1 ) t n v n = ( 4 n-6 ) t n . Then show that u n + 1 = v n . Use these three equations to reprove part (c) directly. 1...
View Full Document
- Spring '10
- Recursion, 1 k, Tn, Enumerative combinatorics, Algebraic Combinatorics Homework