Daily

Random

Practice set

Baltic Way 2021 · Shortlist problem

Combinatorics

A convex nn-gon is triangulated with triangulation PP of n−3n-3 non-intersecting diagonals. An independent set of vertices is a set of vertices of PP where no two vertices are connected by a side or by a diagonal. Let i(P)i(P) be the number of ways to choose an independent set of vertices with respect to the triangulation PP. Prove that the minimum i(P)i(P) is achieved for a zig-zag triangulation.

Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Colorings and configurations · Pigeonhole and extremal arguments · Induction and recursion

Solutions

Solution
  1. Let znz_n be the number of ways to choose an independent set of vertices for a zig-zag triangulation of an nn-gon. It is known that each triangulation has at least two vertices which are not the endpoints of any diagonal. Let AA be one of these vertices for the zig-zag triangulation (see figure above). If the independent set does not contain AA, then by removing the vertex AA we obtain a zig-zag triangulated (n−1)(n-1)-gon. If the independent set contains AA, then it does not contain its two neighbours, and by removing AA and its two neighbours we obtain a zig-zag triangulated (n−3)(n-3)-gon. Therefore znz_n satisfies the recurrence relation
zn=zn−1+zn−3.z_n = z_{n-1} + z_{n-3}.

Diagram for the mathnet 01hx 1 of bw-cand-2021-mn-01hx. Figure 9: A zig-zag triangulation of a 10-gon.

  1. We will consider a triangulation of nn-gon as a graph: the vertices of nn-gon are vertices of the graph, the sides and the diagonals are edges.

  2. Now we will prove the problem statement i(P)≥zni(P) \ge z_n by induction on nn. Base n≤6n \le 6 is trivial. Let the statement hold for all convex triangulations on less than nn vertices. Consider a triangulated nn-gon PP as a graph. The triangulation has at least two vertices of degree 2. Let AA be one of these vertices, u,vu, v be its neighbours. As in part 1), consider independent sets that do not contain AA. The number of these sets equals the number of independent sets in graph P∖AP \setminus A. By induction hypothesis it is at most zn−1z_{n-1}. Now consider independent sets that contain AA (and do not contain uu and vv). The number of these sets equals the number of independent sets in the graph H=P∖{A,u,v}H = P \setminus \{A, u, v\} which has n−3n-3 vertices. But generally speaking, graph HH is not a graph of a triangulation. Let us add some edges to HH in order to obtain graph H∗H^* of some triangulation. This operation of adding new diagonals creates new neighbours in the graph, and thus decreases the number of independent sets. Then i(H)≥i(H∗)≥zn−3i(H) \ge i(H^*) \ge z_{n-3}. Thus,

i(P)≥i(P∖A)+i(H)≥zn−1+zn−3=zn.i(P) \ge i(P \setminus A) + i(H) \ge z_{n-1} + z_{n-3} = z_n.