Unfriendly partitions of a graph (Q753841)

An unfriendly partition of a graph (V,E) is a partition \(V=V_ 0\cup V_ 1\) such that for every vertex in \(V_ i\), the number of its neighbours in \(V_{1-i}\) is bigger or equal to that of its neighbours in \(V_ i\). The existence of an unfriendly partition of a graph (well-known if the graph is finite) is proved in the case (a) the graph has finitely many vertices of infinite degree only, and in the case (b) there exist infinite cardinals \(m_ 0<m_ 1<...<m_ k\), where \(m_ 1,...,m_ k\) are regular, such that \(| \{x\in V\); d(x) is \(finite\}| <m_ 0\) and \(d(x)\in \{m_ 0,...,m_ k\}\) for every x of infinite degree.