A Note on Covering Edge Colored Hypergraphs by Monochromatic Components

[摘要] For $r\geq 2$, $\alpha \geq r-1$ and $k\geq 1$, let $c(r,\alpha ,k)$ be the smallest integer $c$ such that the vertex set of any non-trivial $r$-uniform $k$-edge-colored hypergraph ${\cal H}$ with $\alpha ({\cal H})=\alpha$ can be covered by $c$ monochrom

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

[关键词] Graph theory;edge-coloring;monochromatic component