Nonintersecting perfect matching with reasonable length
Source: Korean Summer Program Practice Test 2016 8
August 17, 2016
combinatorial geometry
Problem Statement
There are distinct points A1,A2,…,A2n with no three collinear. Prove that one can relabel the points with the labels B1,…,B2n so that for each 1≤i<j≤n the segments B2i−1B2i and B2j−1B2j do not intersect and the following inequality holds.
B1B2+B3B4+⋯+B2n−1B2n≥π2(A1A2+A3A4+⋯+A2n−1A2n)