کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4649396 | 1342452 | 2010 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Color-bounded hypergraphs, IV: Stable colorings of hypertrees
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
We consider vertex colorings of hypergraphs in which lower and upper bounds are prescribed for the largest cardinality of a monochromatic subset and/or of a polychromatic subset in each edge. One of the results states that for any integers sâ¥2 and aâ¥2 there exists an integer f(s,a) with the following property. If an interval hypergraph admits some coloring such that in each edge Ei at least a prescribed number siâ¤s of colors occur and also each Ei contains a monochromatic subset with a prescribed number aiâ¤a of vertices, then a coloring with these properties exists with at most f(s,a) colors. Further results deal with estimates on the minimum and maximum possible numbers of colors and the time complexity of determining those numbers or testing colorability, for various combinations of the four color bounds prescribed. Many interesting problems remain open.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issue 9, 6 May 2010, Pages 1463-1474
Journal: Discrete Mathematics - Volume 310, Issue 9, 6 May 2010, Pages 1463-1474
نویسندگان
Csilla Bujtás, Zsolt Tuza,