So I've recently read the infinite graph version of Kuratowski's theorem. It says that a graph $G$ is planar if and only if the following three conditions holds:


1. $|V(G)| \le |\mathbb{R}|$
2. $G$ has at most countably many vertex with degree at least 3
3. $G$ has neither $K\_{3,3}$ nor $K\_5$ subdivision


It is clear that if a graph $G$ is planar, then all three conditions must hold. To show its converse, I assume that there is a graph that satisfies all three condition and yet it is not planar. I have eliminated condition 1 and 3 as a source of non-planarity of $G$, but I cannot derive a contradiction with 2. Any help would be greatly appreciated.



Generalisation of Kuratowski's theorem
I am not sure which direction gives you trouble, but the second condition is necessary, by the Moore-Young theorem, or a somewhat weaker version thereof, as discussed by Greg Kuperberg [here.](https://mathoverflow.net/questions/27244/how-many-tacks-fit-in-the-plane)


For the right direction, condition 2 says that there are countably many vertices, since you can just erase those of degree 2, and vertices of degree 1 clearly don'make any difference, planarity wise. So, now, we have a graph with countably many vertices, and thus countably many edges, such that any *finite* subgraph is planar. You want to show that the graph is planar. This is a simple compactness/Arzela-Ascoli type argument - something very similar (but stronger) is showed in the last section of I. Rivin, [Combinatorial Optimization in Geometry](https://www.sciencedirect.com/science/article/pii/S0196885803000939?via%3Dihub) *Adv. in Appl. Math.* 31 (2003), no. 1, 242–271. (There is a [free arxiv.org version](https://arxiv.org/abs/math/9907032), in case that matters.)


