Problem

Source: Romanian TST 2022, Test 1, P5

Tags: combinatorics, geometry



Given is an integer $k\geq 2$. Determine the smallest positive integer $n$, such that, among any $n$ points in the plane, there exist $k$ points among them, such that all distances between them are less than or equal to $2$, or all distances are strictly greater than $1$.