MathDB
Polygonal

Source: Romania TST 2016 Day 5 Problem 3

June 2, 2016
combinatorics

Problem Statement

A set S={s1,s2,...,sk}S=\{ s_1,s_2,...,s_k\} of positive real numbers is "polygonal" if k3k\geq 3 and there is a non-degenerate planar kk-gon whose side lengths are exactly s1,s2,...,sks_1,s_2,...,s_k; the set SS is multipolygonal if in every partition of SS into two subsets,each of which has at least three elements, exactly one of these two subsets in polygonal. Fix an integer n7n\geq 7. (a) Does there exist an nn-element multipolygonal set, removal of whose maximal element leaves a multipolygonal set? (b) Is it possible that every (n1)(n-1)-element subset of an nn-element set of positive real numbers be multipolygonal?