Large 2-coloured matchings in 3-coloured complete hypergraphs
Combinatorics
2012-09-13 v3
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\'arf\'as.
Keywords
Cite
@article{arxiv.1103.2326,
title = {Large 2-coloured matchings in 3-coloured complete hypergraphs},
author = {Tamás Terpai},
journal= {arXiv preprint arXiv:1103.2326},
year = {2012}
}
Comments
10 pages, 5 figures; reviewed for submission to the Electronic Journal of Combinatorics