加载中…
2011-03-11
Large 2-coloured matchings in 3-coloured complete hypergraphs
Tamás Terpai
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本