کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4656901 | 1632987 | 2014 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Exactly m-coloured complete infinite subgraphs
ترجمه فارسی عنوان
زیرگرافهای بی نهایت کاملا دقیق م رنگ است
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
چکیده انگلیسی
Given an edge colouring of a graph with a set of m colours, we say that the graph is exactly m-coloured if each of the colours is used. The question of finding exactly m-coloured complete subgraphs was first considered by Erickson in 1994; in 1999, Stacey and Weidl partially settled a conjecture made by Erickson and raised some further questions. In this paper, we shall study, for a colouring of the edges of the complete graph on N with exactly k colours, how small the set of natural numbers m for which there exists an exactly m-coloured complete infinite subgraph can be. We prove that this set must have size at least 2k; this bound is tight for infinitely many values of k. We also obtain a version of this result for colourings that use infinitely many colours.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series B - Volume 106, May 2014, Pages 163-173
Journal: Journal of Combinatorial Theory, Series B - Volume 106, May 2014, Pages 163-173
نویسندگان
Bhargav P. Narayanan,