Large 2-Coloured Matchings in 3-Coloured Complete Hypergraphs

  • Tamás Terpai
DOI: https://doi.org/10.37236/2324
Keywords: generalized Ramsey theory on hypergraphs

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.
Published
2012-11-01
How to Cite
Terpai, T. (2012). Large 2-Coloured Matchings in 3-Coloured Complete Hypergraphs. The Electronic Journal of Combinatorics, 19(4), P18. https://doi.org/10.37236/2324
Issue
Volume 19, Issue 4 (2012)
Article Number
P18