Two points in $\mathbb Q$ are called connected, if their euclidean distance is exactly $1$.
You are now allowed to also jump from any point in $\mathbb Q^n$ to another, if they are connected in $\mathbb Q^n$. The question now is: What is the smallest n that allows you to reach any point in $\mathbb Q$ , if you start in an abitrary point in $\mathbb Q$, if you are also allowed to jump to a point in $\mathbb Q^n$ , if they were connected in $\mathbb Q^n$.
For example it is to see, that you can connect all points in $\mathbb N$ already for n = 1. 1 is connected to 2 and 2 is connected to 3 and so on... Ultimately you know, that you can pick two arbitrary points of $\mathbb N$ and that there is a way to get from one point to the other by just hopping from one point to the other. n = 1 doesn't do the job for Q, because if you start in the point 1 you can actually reach all points $\mathbb N$, however you cannot reach the point 0.5 which is also in $\mathbb Q$
Does someone know the name of that problem? I really want to read up on that topic, especially for generalizations.
// I found the name of information to the problem: It is related to http://en.wikipedia.org/wiki/Beckman%E2%80%93Quarles_theorem