Some New Ramsey Colorings
نویسندگان
چکیده
منابع مشابه
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found using known colorings as building blocks. AMS Subject Classifications: 05D10, 05D04
متن کاملRamsey numbers for local colorings
The concept of a local k-coloring of a graph G is introduced and the corresponding local k-Ramsey number r 1 ~c(G) is considered. A local k-coloring of G is a coloring ofits edges in such a way that the edges incident to any vertex of G are colored with at most k colors. The number r 1 ~c(G) is the minimum m for which Km contains a monochromatic copy of G for every local k-coloring of Km. The n...
متن کاملRamsey-type results for Gallai colorings
A Gallai-coloring (G-coloring) is a generalization of 2-colorings of edges of complete graphs: a G-coloring of a complete graph is an edge coloring such that no triangle is colored with three distinct colors. Here we extend some results known earlier for 2-colorings to G-colorings. We prove that in every G-coloring of Kn there exists each of the following: 1. a monochromatic double star with at...
متن کاملAn Improvement to Mathon's Cyclotomic Ramsey Colorings
In this note we show how to extend Mathon’s cyclotomic colorings of the edges of some complete graphs without increasing the maximum order of monochromatic complete subgraphs. This improves the well known lower bound construction for multicolor Ramsey numbers, in particular we obtain R3(7) ≥ 3214.
متن کاملAnti-Ramsey Colorings in Several Rounds
(joint work with Aart Blokhuis, András Gyárfás and Miklós Ruszinkó) For positive integers k ≤ n and t let χ t (k, n) denote the minimum number of colors such that at least in one of the total t colorings of edges of K n all k 2 edges of every K k ⊆ K n get different colors. Generalizing a result of Körner and Simonyi, it is shown in this paper that χ t (3, n) = Θ(n 1/t). Also two-round coloring...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1998
ISSN: 1077-8926
DOI: 10.37236/1367