Large 2-coloured matchings in 3-coloured complete hypergraphs
Tam\'as Terpai
TL;DR
This paper proves a generalized Ramsey-type theorem ensuring large 2-coloured matchings in 3-coloured complete 3-uniform hypergraphs, advancing understanding in hypergraph Ramsey theory.
Contribution
It establishes a new result confirming a conjecture by A. Gyárfás about large 2-coloured matchings in 3-coloured hypergraphs.
Findings
Proves a generalized Ramsey-type result for hypergraphs
Supports Gyárfás's conjecture on 2-coloured matchings
Advances theoretical understanding of hypergraph colourings
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research