Large 2-Coloured Matchings in 3-Coloured Complete Hypergraphs

Tamás Terpai

Abstract


We prove the generalized Ramsey-type result on large $2$-coloured matchings in a $3$-coloured complete $3$-uniform hypergraph, supporting a conjecture by A. Gyárfás.

Keywords


generalized Ramsey theory on hypergraphs

Full Text: PDF