Cover $k$-Uniform Hypergraphs by Monochromatic Loose Paths

[摘要] A conjecture of Gyárfás and Sárközy says that in every $2$-coloring of the edges of the complete $k$-uniform hypergraph $\mathcal{K}_n^k$, there are two disjoint monochromatic loose paths of distinct colors such that they cover all but at most $k-2$ verti

[学科分类] 离散数学和组合数学

[关键词] Hypergraph;Monochromatic loose path