A lower bound for set‐coloring Ramsey numbers
نویسندگان
چکیده
Abstract The set‐coloring Ramsey number is defined to be the minimum such that if each edge of complete graph assigned a set colors from , then one contains monochromatic clique size . case usual ‐color number, and was studied by Erdős, Hajnal Rado in 1965, Erdős Szemerédi 1972. first significant results for general were obtained only recently, Conlon, Fox, He, Mubayi, Suk Verstraëte, who showed bounded away 0 1. In range however, their upper lower bounds diverge significantly. this note we introduce new (random) coloring, use it determine up polylogarithmic factors exponent essentially all
منابع مشابه
A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers
For k ≥ 5, we establish new lower bounds on the Schur numbers S(k) and on the k-color Ramsey numbers of K3. For integers m and n, let [m,n] denote the set {i |m ≤ i ≤ n}. A set S of integers is called sum-free if i, j ∈ S implies i + j 6∈ S, where we allow i = j. The Schur function S(k) is defined for all positive integers as the maximum n such that [1, n] can be partitioned into k sum-free set...
متن کاملNew Lower Bound for Multicolor Ramsey Numbers for Even Cycles
For given finite family of graphs G1, G2, . . . , Gk, k ≥ 2, the multicolor Ramsey number R(G1, G2, . . . , Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors then there is always a monochromatic copy of Gi colored with i, for some 1 ≤ i ≤ k. We give a lower bound for k−color Ramsey number R(Cm, Cm, . . . , Cm), where m ≥ ...
متن کاملNew Lower Bound Formulas for Multicolored Ramsey Numbers
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
متن کاملA bound for multicolor Ramsey numbers
The Ramsey number R(G1; G2; : : : ; Gn) is the smallest integer p such that for any n-edge coloring (E1; E2; : : : ; En) of Kp; Kp[Ei] contains Gi for some i, Gi as a subgraph in Kp[Ei]. Let R(m1; m2; : : : ; mn):=R(Km1 ; Km2 ; : : : ; Kmn); R(m; n):=R(m1; m2; : : : ; mn) if mi=m for i=1; 2; : : : ; n. A formula is obtained for R(G1; G2; : : : ; Gn). c © 2001 Elsevier Science B.V. All rights re...
متن کاملAn Upper Bound for the Ramsey Numbers
The Ramsey number r(H,G) is defined as the minimum N such that for any coloring of the edges of the N -vertex complete graph KN in red and blue, it must contain either a red H or a blue G. In this paper we show that for any graph G without isolated vertices, r(K3, G) ≤ 2q + 1 where G has q edges. In other words, any graph on 2q + 1 vertices with independence number at most 2 contains every (iso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2023
ISSN: ['1042-9832', '1098-2418']
DOI: https://doi.org/10.1002/rsa.21173