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$.
To 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 \), we proceed as follows:

1. **Lower Bound Construction:**
   - Consider \( k-1 \) points \( C_1, C_2, \ldots, C_{k-1} \) such that \( C_iC_j > 3 \) for all \( i \neq j \). For concreteness, assume \( C_i \)'s are the vertices of a regular \( (k-1) \)-gon with side length greater than \( 3 \).
   - Construct \( k-1 \) circles \( \omega_i = \left(C_i, \frac{1}{2}\right) \) and take \( k-1 \) different points at random in each circle. Thus, we have constructed \( (k-1)^2 \) points (disregarding the points \( C_i \)).
   - Consider a group of \( k \) points. By the pigeonhole principle (PHP), there exist two points from different circles, so the distance between them is \( > 3 - \frac{1}{2} - \frac{1}{2} = 2 \). Also, by the PHP, there are two points from the same circle \( \omega_i \), so the distance between them is \( \leq \frac{1}{2} + \frac{1}{2} = 1 \).
   - Therefore, there does not exist a set of \( k \) points such that the distances between any two of them are either \( > 1 \) or \( \leq 2 \).

2. **Upper Bound:**
   - Assume we have \( k^2 - 2k + 2 \) points. Consider the graph \( G \) with \( k^2 - 2k + 2 \) vertices corresponding to the points and color the edge between two points in green if the distance between them is \( \leq 1 \) and red otherwise.
   - **Lemma:** If \( AB \) and \( AC \) are green, then \( BC \leq 2 \).
     - **Proof:** Since \( AB \) and \( AC \) are green, \( AB \leq 1 \) and \( AC \leq 1 \). By the triangle inequality, \( BC \leq AB + AC = 1 + 1 = 2 \).

3. **Proof of Upper Bound:**
   - We will now prove that there is either a clique of \( k \) points where all distances are \( \leq 2 \) or a red clique of \( k \) vertices. Assume the contrary.
   - Notice that the Lemma implies that if a vertex \( X \) is part of \( \geq k-1 \) green segments, then \( X \) combined with the \( k-1 \) vertices form a clique of the first type.
   - This implies that each vertex has at least \( (k^2 - 2k + 2) - 1 - (k - 2) = k^2 - 3k + 3 \) incident red edges.
   - Thus, we have:
     \[
     |E_{\text{red}}| \geq \left\lfloor \frac{|V|(k^2 - 3k + 3)}{2} \right\rfloor = \left\lfloor \frac{(k^2 - 2k + 2)(k^2 - 3k + 3)}{2} \right\rfloor \geq \frac{(k^2 - 2k + 2)(k^2 - 3k + 3)}{2} - \frac{1}{2}
     \]
   - However, since we assumed that there isn't a red \( K_k \), then by Turan's theorem we have:
     \[
     |E_{\text{red}}| \leq \left\lfloor \left(1 - \frac{1}{k-1}\right) \cdot \frac{|V|^2}{2} \right\rfloor = \left\lfloor \frac{k-2}{k-1} \cdot \frac{(k^2 - 2k + 2)^2}{2} \right\rfloor \leq \frac{k-2}{k-1} \cdot \frac{(k^2 - 2k + 2)^2}{2}
     \]
   - Now we reach a contradiction by:
     \[
     \frac{(k^2 - 2k + 2)(k^2 - 3k + 3)}{2} - \frac{1}{2} > \frac{k-2}{k-1} \cdot \frac{(k^2 - 2k + 2)^2}{2}
     \]
     \[
     \iff (k-1)(k^2 - 2k + 2)(k^2 - 3k + 3) - (k-1) - (k-2)(k^2 - 2k + 2)^2 > 0
     \]
     \[
     \iff k^2 - 3k + 3 > 0 \iff \frac{1}{4} (2k - 3)^2 + \frac{3}{4} > 0
     \]
   - So we proved that \( |E_{\text{red}}| \leq \frac{k-2}{k-1} \cdot \frac{(k^2 - 2k + 2)^2}{2} < \frac{(k^2 - 2k + 2)(k^2 - 3k + 3)}{2} - \frac{1}{2} \leq |E_{\text{red}}| \), contradiction.

The final answer is \( \boxed{ n = (k-1)^2 + 1 = k^2 - 2k + 2 } \)