کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647553 | 1342359 | 2013 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A lower bound for the chromatic capacity in terms of the chromatic number of a graph
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A lower bound for the chromatic capacity in terms of the chromatic number of a graph A lower bound for the chromatic capacity in terms of the chromatic number of a graph](/preview/png/4647553.png)
چکیده انگلیسی
When the vertices and edges are coloured with k colours, an edge is called monochromatic if the edge and the two vertices incident with it all have the same colour. The chromatic capacity of a graph G, ÏCAP(G), is the largest integer k such that the edges of G can be coloured with k colours in such a way that when the vertices of G are coloured with the same set of colours, there is always a monochromatic edge. It is easy to see that ÏCAP(G)â¤Ï(G)â1. Greene has conjectured that there is an unbounded function f such that ÏCAP(G)â¥f(Ï(G)). In this article we prove Greene's conjecture.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 20, 28 October 2013, Pages 2146-2149
Journal: Discrete Mathematics - Volume 313, Issue 20, 28 October 2013, Pages 2146-2149
نویسندگان
Bing Zhou,