Decomposing hypergraphs into $k$-colorable hypergraphs
نویسندگان
1 Isfahan University of Technology
2 Tarbiat Modares University
doi
10.22108/toc.2014.5146چکیده
For a given hypergraph $H$ with chromatic number $\chi(H)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) $\{E_1,E_2,\ldots,E_l\}$ for $E(H)$, such that the hypergraph induced by $E_i$ for each $1\leq i\leq l$ is $k$-colorable, is $\lceil \log_{k} \chi(H) \rceil$.
