Unfriendly partitions for graphs not containing a subdivision of an infinite clique
We prove that in any graph containing no subdivision of an infinite clique there exists a partition of the vertices into two parts, satisfying the condition that every vertex has at least as many neighbors in the part not containing it as it has in its own part.
Mathematics Subject Classification (2000)05C63
Unable to display preview. Download preview PDF.