Unfriendly partition of a graph

An unfriendly partition $V=A\bigsqcup B$ puts at least as many neighbours of every vertex in the opposite part as in its own part.