中文

关于大环与完全图相关的星临界Ramsey数

组合数学 2020-09-16 v2

摘要

KnK_n表示含nn个顶点的完全图,G,HG, H为有限图。考虑KnK_n边的一种二染色。当KnK_n中存在第一种颜色(红)的GG副本或第二种颜色(蓝)的HH副本时,记为Kn(G,H)K_n\rightarrow (G,H)。Ramsey数r(G,H)r(G, H)定义为使得Kn(G,H)K_{n} \rightarrow (G, H)成立的最小正整数nn。星临界Ramsey数r(G,H)r_*(G, H)定义为满足Kr(G,H)1K1,k(G,H)K_{r(G,H)-1} \sqcup K_{1,k} \rightarrow (G, H)的最大kk值。本文中,对m7m \geq 7n(m3)(m1)n \geq (m-3)(m-1),我们求得了r(Cn,Km)r_*(C_n, K_m)

关键词

引用

@article{arxiv.1903.10891,
  title  = {On Star critical Ramsey numbers related to large cycles versus complete graphs},
  author = {C. J. Jayawardene and W. C. W. Navaratna},
  journal= {arXiv preprint arXiv:1903.10891},
  year   = {2020}
}

备注

10 pages, 2 figures. arXiv admin note: text overlap with arXiv:1902.02646