|
|
|
|
Decomposing hypergraphs into k-colorable hypergraphs
|
|
|
|
|
|
|
|
نویسنده
|
امیدی غلام رضا ,تاجبخش خسرو
|
|
منبع
|
transactions on combinatorics - 2014 - دوره : 3 - شماره : 2 - صفحه:31 -33
|
|
چکیده
|
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 $1leq ileq l$ is $k$-colorable, is $lceillog_{k} chi(h) rceil$.
|
|
کلیدواژه
|
Hypergraph ,chromatic number ,k-Colorable
|
|
آدرس
|
isfahan university of technology, Isfahan University of Technology, ایران, Tarbiat Mo dares University, Department of Mathematics, Faculty of Mathematical Sciences, Tarbiat Mo dares University, P O Box 14115-134, Tehran, ایران
|
|
پست الکترونیکی
|
khtajbakhsh@modares.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|