Combinatorics and Graph Theory · Problem 3.5.5

Generating Functions — David Guichard

Mathematics — Combinatorics · catalan-numbers-polygon-triangulation

Problem

A convex polygon with

n \geq 3

sides can be divided into triangles by inserting

n-3

non-intersecting diagonals. In how many different ways can this be done? The possibilities for

n = 5

are shown.