Large 2-coloured matchings in 3-coloured complete hypergraphs
classification
🧮 math.CO
keywords
colouredcompletelargematchingsconjecturegeneralizedhypergraphhypergraphs
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.