含C<sub>6</sub>和K<sub>n,n</sub>的多色二部Ramsey数

林启忠; 杜智华

您当前的位置：

首页 >

文章列表页 >

含C₆和K_n,n的多色二部Ramsey数

数理科学 | 更新时间：2026-01-21

- 含C₆和K_n,n的多色二部Ramsey数
- 含C₆和K_n,n的多色二部Ramsey数
- 新疆大学学报（自然科学版中英文） 2011年28卷第4期页码：401-404
- 作者机构：
  
  1. 福州大学数学与计算机科学学院
  2. 新疆师范大学数学科学学院
- 作者简介：
- 基金信息：
  
  国家自然科学基金青年项目(11101086);福建省教育厅科技项目(JK2010007)
- DOI：
  中图分类号： O157.5
- 纸质出版：2011
- 稿件说明：
移动端阅览
[1]林启忠,杜智华.含C_6和K_(n,n)的多色二部Ramsey数[J].新疆大学学报(自然科学版),2011,28(04):401-404.

林启忠, 杜智华. 含C₆和K_n,n的多色二部Ramsey数[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2011, 28(4): 401-404.
[1]林启忠,杜智华.含C_6和K_(n,n)的多色二部Ramsey数[J].新疆大学学报(自然科学版),2011,28(04):401-404. DOI：

林启忠, 杜智华. 含C₆和K_n,n的多色二部Ramsey数[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2011, 28(4): 401-404. DOI：

摘要

设多色二部Ramsey数brk(C6;Kn

n)是最小的正整数N使得对二部完全图KN

N的边进行k+1着色时

总存在前k色中某种单色的C6或者第k+1色的Kn

n.本文主要利用随机方法得到brk(C6;Kn

n)=Θlong33//22 n对k≥3都成立

并且得到br2(C6;Kn

n)≥c(nlolgoglo3g nn)3/2对充分大的n成立.

Abstract

Let brk(C6;Kn

n) be the smallest N such that if all edges of KN

N are colored by k +1 colors

then there is a monochromatic C6 in one of the first k colors or a monochromatic Kn

n in the last color.It is shown that brk(C6;Kn

n) = Θ long33//22 n for k ≥ 3

and br2(C6;Kn

n) ≥ c(nlolgoglo3g nn)3/2for large n.

关键词

Keywords

references

Thomason A.On finite Ramsey numbers[J].Europ J Combin,1982,3:263-273.

Conlon D.A new upper bound for the bipartite Ramsey problem[J],J Graph Theory,2008,58:351-356.

Li Y,Tang X,Zang W.Ramsey functions involving Km,n with n large[J].Discrete Math,2005,300:120-128.

Caro Y,Rousseau C.Asymptotic bounds for bipartite Ramsey numbers[J].Electronic J Combin,2001,8(1):R17.

Lin Q,Li Y.Bipartite ramsey numbers involving large Kn,n[J].European J Combin,2009,30:923-928.

Alon N,R¨odl V.Sharp bounds for some multicolor Ramsey numbers[J].Combinatorics,2005,25:125-141.

Lin Q,Li Y.Multicolor Bipartite Ramsey Number of C4and large Kn,n[J].J Graph Theory,2011,67:47-54.

Bohman T,Keevash P.The early evolution of H-free process[J].Invent Math,2010,181:291-336.

Spencer J.Asymptotic lower bounds for Ramsey functions[J],Discrete Math,1977,20:69-76.

Kim J H.The Ramsey number R(3,t)has order of magnitude t2/log t[J].Random Structures Algorithms,1995,7:173-207.

Bohman T.The triangle-free process[J].Advances in Math,2009,221:1653-1677.

Erdo s P,Faudree R,Rousseau C,et al.A Ramsey Problem of Harary on graphs with prescribed size[J].Discrete Math,1987,67:227-233.

Krivelevich M.Bounding Ramsey numbers through large deviation inequalities[J].Random Struct Algo,1995,7:145-155.

Li Y,Zang W.Ramsey numbers involving large dense graphs and bipartite Turan numbers[J].J Combin Theory Ser B,2003,87:280-288.

Dong L,Li Y,Lin Q.Ramsey numbers involving graphs with large degrees[J].Applied Math Letters,2009,22:1577-1580.

Bondy J,Simonovits M.Cycles of even length in graphs[J].J Combin Theory Ser B,1974,16:97-105.

K¨ova′ri T,S′os T,Tura′n P.On a problem of K.Zarankiewicz[J].Colloq Math,1954,3:50-57.

Fu¨redi Z.An upper bound on Zarankiewicz’problem[J].Combin Probab Comput,1996,5:29-33.

Brouwer A E,Cohen A M,Neumaier A.Distance-Regular Graphs,Springer-Verlag[M].Berlin,1989.

Laze F bnik,Ustime nko V A,Woldar A J.Polarities and2k-cycle-free graphs[J].Discrete Math,1999,197/198:503-513.

Tanner R M.Explicit concentrators from generalized N-gons[J].SIAM J Algebraic Discrete Methods,1984,5:287-293.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

关于3-可选平面图的一点注记(英文)

C_m□C_n的支撑树的一些性质(英文)

含C6和Kn,n的多色二部Ramsey数

含C6和Kn,n的多色二部Ramsey数

DOI：

摘要

Abstract

关键词

Keywords

references

含C₆和K_n,n的多色二部Ramsey数

含C₆和K_n,n的多色二部Ramsey数