Ramsey-type problem I'm trying to solve the following problem :
In a group of $3n$ people each member knows exactly three languages from five given languages.
Prove that it is always possible to partition the group into three groups of n people in such a way that in each group everybody knows at least one language from those five given . I tried to use the pigeonhole principle but it lead nowhere . A little hint would help a lot.

It seems the following.
By induction we can prove more strong 
Claim. It is always possible to partition the group into three groups $A, B,C$ of $n$ people in such a way that there exists three different languages $a$, $b$, and $c$ such that in the group $A$ everybody knows the language $a$, in the group $B$ everybody knows the language $b$, and in the group $C$ everybody knows the language $c$. 
The base of the induction is trivial.  Suppose that we already proved Claim for $n\ge 1$. Only the following cases are possible.  
1) There exists a subgroup of three people which in common know all 5 languages an no two people of the subgroup know the same three languages. In this case by the inductive assumption we can divide the rest $3n$ people into three groups satisfying Claim for $n$. A short check shows that in this case we can always add exactly one of the people of the subgroup to each of the groups 
to satisfy Claim for $n+1$. 
If Case 1 does not hold the one of the following cases hold 
2) Each of the five given languages is known by some person of the group, but for each subgroup of three people which in common know all 5 languages there are two people of the subgroup who know the same three languages. In this case there is no two persons who in common know exactly 4 languages, because if we add to them the person who knows the fifth language then we obtain a subgroup  satisfying the condition from Case 1. Suppose that a person knows languages 1, 2, 3. Then any other person can know one of the following set of languages: $\{1,2,3\}$,  $\{1,4,5\}$, $\{2,4,5\}$, and $\{3,4,5\}$. Moreover, no two persons can know different sets of languages from the last three sets.  So in this case we have a $k$ people who know the languages $\{1,2,3\}$ and $3n+3-k$ people who know the languages $\{a,4,5\}$ for some $a\in\{1,2,3\}$. For each value of $k$ it is easy to obtain the partition of the group satisfying Claim (if $k<n+1$ then the languages are $a$, 4, and 5; if $n+1\le k<2n+2$ then the languages are $a$, 4, and $b\in \{1,2,3\}\setminus\{a\}$; if $k\ge 2n+2$ then the languages are 1, 2, and 3).
If Cases 1 and 2 do not hold then we have Case 3,  Case 4 or Case 5.
3) All persons of the group of $3n+3$ people know in common exactly 4 languages and there exists a subgroup of three people such that no two people of the subgroup know the same three languages. In this case by the inductive assumption 
we can divide the rest $3n$ into three groups satisfying Claim for $n$. A short check shows that in this case we can always add exactly one of the people of the subgroup to each of the groups 
to satisfy Claim. 
4) All persons of the group of $3n+3$ people know in common exactly 4 languages and 
for any three people of the group two of them know the same three languages. In this case we obtain a partition satisfying Claim similarly to Case 2, but even simpler.  
5) All persons of the group of $3n+3$ people know in common exactly 3 languages. In this case the required partition is trivial.
