Large 2-coloured matchings in 3-coloured complete hypergraphs

preprint2012arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.