MathDB
From combinatorics to geometry, through algebra

Source: RMM 2024 Problem 3

February 29, 2024
geometrycombinatoricslinear algebracombinatorial geometryRMMSets

Problem Statement

Given a positive integer nn, a collection S\mathcal{S} of n2n-2 unordered triples of integers in {1,2,,n}\{1,2,\ldots,n\} is nn-admissible if for each 1kn21 \leq k \leq n - 2 and each choice of kk distinct A1,A2,,AkSA_1, A_2, \ldots, A_k \in \mathcal{S} we have A1A2Akk+2. \left|A_1 \cup A_2 \cup \cdots A_k \right| \geq k+2. Is it true that for all n>3n > 3 and for each nn-admissible collection S\mathcal{S}, there exist pairwise distinct points P1,,PnP_1, \ldots , P_n in the plane such that the angles of the triangle PiPjPkP_iP_jP_k are all less than 6161^{\circ} for any triple {i,j,k}\{i, j, k\} in S\mathcal{S}?
Ivan Frolov, Russia