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.
Bibliographical noteFunding Information:
The research was supported by BSF grant no. 2006099 and by an ISF grant.
© 2017, János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics