On Some Multicolor Ramsey Numbers Involving $K_3+e$ and $K_4-e$

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Some Multicolor Ramsey Numbers Involving $K_3+e$ and $K_4-e$

The Ramsey number R(G1, G2, G3) is the smallest positive integer n such that for all 3-colorings of the edges of Kn there is a monochromatic G1 in the first color, G2 in the second color, or G3 in the third color. We study the bounds on various 3-color Ramsey numbers R(G1, G2, G3), where Gi ∈ {K3,K3 + e,K4 − e,K4}. The minimal and maximal combinations of Gi’s correspond to the classical Ramsey ...

متن کامل

On Some Multicolor Ramsey Numbers

The Ramsey number R(G1, G2, G3) is the smallest positive integer n such that for all 3-colorings of the edges of Kn there is a monochromatic G1 in the first color, G2 in the second color, or G3 in the third color. We study the bounds on various 3-color Ramsey numbers R(G1, G2, G3), where Gi ∈ {K3,K3 + e,K4 − e,K4}. The minimal and maximal combinations of Gi’s correspond to the classical Ramsey ...

متن کامل

Bounds on Some Ramsey Numbers Involving Quadrilateral

Xiaodong Xu, Guangxi Academy of Sciences, Nanning, China Zehui Shao, Huazhong University of Science and Technology, Wuhan, China Stanis law Radziszowski∗, Rochester Institute of Technology, NY, USA For graphs G1, G2, · · · , Gm, the Ramsey number R(G1, G2, · · · , Gm) is defined to be the smallest integer n such that any m-coloring of the edges of the complete graph Kn must include a monochroma...

متن کامل

Multicolor Ramsey numbers involving graphs with long suspended paths

Let G be a graph with chromatic number x a °d with t being the minimum number of points in any color class of any point-coloring of G with x colors. Let H be any connected graph and let Hn be a graph on n points which is homeomorphic to H. It is proved that if n is large enough, the Ramsey number r{G, Hn) satisfies r(G, Hn) = (x — l)(n —l) + r. It is also shown that for some G, no such result h...

متن کامل

Multicolor Ramsey numbers for some paths and cycles

We give the multicolor Ramsey number for some graphs with a path or a cycle in the given sequence, generalizing a results of Faudree and Schelp [4], and Dzido, Kubale and Piwakowski [2, 3].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2012

ISSN: 0895-4801,1095-7146

DOI: 10.1137/110846622