In a company of $6$ sousliks each souslik has $4$ friends. Is it always possible to divide this company into two groups of $3$ sousliks such that in both groups all sousliks are friends?
Each person (which I assume are what sousliks are) can only have one person they are not friends with. So if $A$ is not friends with $B$ then $B$ is not friends with $A$ and both $A$ and $B$ are friends with everyone else. So with six people we get $3$ disjoint pairs who are not friends with each other. Then just put one person from each pair into each group