MathDB

A dissection of a convex polygon into finitely many triangles by segments is called a trilateration if no three vertices of the created triangles lie on a single line (vertices of some triangles might lie inside the polygon). We say that a trilateration is good if its segments can be replaced with one-way arrows in such a way that the arrows along every triangle of the trilateration form a cycle and the arrows along the whole convex polygon also form a cycle. Find all

n\ge 3

such that the regular

n

-gon has a good trilateration.

Problem Statement