Problem

Source: Kyiv mathematical festival 2015

Tags: combinatorics, Kyiv mathematical festival, graph theory



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?