A simple graph has $N{}$ vertices and less than $3(N-1)/2$ edges. Prove that its vertices can be divided into two non-empty groups so that each vertex has at most one neighbor in the group it doesn't belong to.