Large 2-coloured matchings in 3-coloured complete hypergraphs

Details Large 2-coloured matchings in 3-coloured complete hypergraphs Large 2-coloured matchings in 3-coloured complete hypergraphs

2011-03-11

arxiv.org/abs/1103.2326v2

Mathematics

Combinatorics

8 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Large 2-coloured matchings in 3-coloured complete hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Large 2-coloured matchings in 3-coloured complete hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large 2-coloured matchings in 3-coloured complete hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-430811