3 research outputs found
Improved bounds on the multicolor Ramsey numbers of paths and even cycles
We study the multicolor Ramsey numbers for paths and even cycles,
and , which are the smallest integers such that every coloring of
the complete graph has a monochromatic copy of or
respectively. For a long time, has only been known to lie between
and . A recent breakthrough by S\'ark\"ozy and later
improvement by Davies, Jenssen and Roberts give an upper bound of . We improve the upper bound to . Our approach uses structural insights in connected graphs without a
large matching. These insights may be of independent interest
THE ELECTRONIC JOURNAL OF COMBINATORICS (2014), DS1.14 References
and Computing 11. The results of 143 references depend on computer algorithms. The references are ordered alphabetically by the last name of the first author, and where multiple papers have the same first author they are ordered by the last name of the second author, etc. We preferred that all work by the same author be in consecutive positions. Unfortunately, this causes that some of the abbreviations are not in alphabetical order. For example, [BaRT] is earlier on the list than [BaLS]. We also wish to explain a possible confusion with respect to the order of parts and spelling of Chinese names. We put them without any abbreviations, often with the last name written first as is customary in original. Sometimes this is different from the citations in other sources. One can obtain all variations of writing any specific name by consulting the authors database of Mathematical Reviews a
Multicolor Ramsey numbers for paths and cycles
For given graphs Gβ,Gβ,...,Gβ, k β₯ 2, the multicolor Ramsey number R(Gβ,Gβ,...,Gβ) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors, then it is always a monochromatic copy of some , for 1 β€ i β€ k. We give a lower bound for k-color Ramsey number R(Cβ,Cβ,...,Cβ), where m β₯ 8 is even and Cβ is the cycle on m vertices. In addition, we provide exact values for Ramsey numbers R(Pβ,Cβ,Cβ), where Pβ is the path on 3 vertices, and several values for R(Pβ,Pβ,Cβ), where l,m,p β₯ 2. In this paper we present new results in this field as well as some interesting conjectures