Large 2-coloured matchings in 3-coloured complete hypergraphs

Abstract

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.

10 pages, 5 figures; reviewed for submission to the Electronic Journal of Combinatorics

References in corpus (1)

• 2-Colored Matchings in a 3-Colored K^{3}_{12}