Large 2-coloured matchings in 3-coloured complete hypergraphs
Terpai, Tamás
Original · EN
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árfás.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.