My question is about the following statement about planar graphs:
A graph is planar (i.e. can be embedded in the plane) if and only if it can be embedded in the sphere $S^2$.
By an embedding we mean the following:
To every vertex $v \in V$ we associate a unique point in $\mathbb{R}^2$(or $S^2$). To every edge $e \in G$ we associate a unique simple arc, which is a homeomorphic image of $[0,1]$, connecting the points associated to its end vertices such that no two arcs intersect other than in a common vertex point.
The "only if" part of the statement above follows directly by using stereographic projection, which gives an embedding $\mathbb{R}^2 \hookrightarrow S^2$. For the "if" part, in every proof I find one simply says that in an embedding of a graph in $S^2$, one can always avoid a point and can therefore use stereographic projection again to get the embedding in $\mathbb{R}^2$.
I can see this fact being true for finite graphs, as the embedded graph is just the bijective continuous image of finitely many intervals glued together in some way (which is a compact space), so if the image was the whole $S^2$, we would get a homeomorphism between $S^2$ and something which isn't $S^2$.
But what about infinite graphs? As far as I know, a graph is just defined to be a tuple $(V,E)$, where $V$ is a set (of vertices) and $E$ is a set consisting of some 2-element-subsets of $V$. So $V$ can be basically anything, so I could for example just take $V = S^2$ (as a set), or any other (uncountable) infinite set. In this case, how can I ensure that in a drawing of the graph on $S^2$ I can still avoid one point? Or is this statement not even true for infinite graphs?
