Problem

Source: Kyiv mathematical festival 2015

Tags: Kyiv mathematical festival, graph theory, combinatorics



In a company of 7 sousliks each souslik has 4 friends. Is it always possible to find in this company two non-intersecting groups of 3 sousliks each such that in both groups all sousliks are friends?