Large 2-coloured matchings in 3-coloured complete hypergraphs
  We prove a generalized Ramsey-type result on large 2-coloured matchings in a 3-coloured complete 3-uniform hypergraph, supporting a conjecture by A. Gy\'arf\'as. 
Tam\'as Terpai
math.CO