The Ramsey number R(C8, K8)

被引：5

作者：

Zhang, Yunqing ^{[1
]}

Zhang, Ke Min ^{[1
]}

机构：

[1] Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China

来源：

DISCRETE MATHEMATICS | 2009年 / 309卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Ramsey number; Cycle; Complete graph; CYCLE;

D O I：

10.1016/j.disc.2007.11.064

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For two given graphs G(1) and G(2), the Ramsey number R(G(1), G(2)) is the smallest integer n such that for any graph G of order n, either G contains G(1) or the complement of G contains G(2). Let C-m denote a cycle of length m and K-n a complete graph of order n. We show that R(C-8, K-8) = 50. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：1084 / 1090

页数：7

共 50 条

[1] The planar Ramsey number PR(C4, K8)
Chen, Yaojun
Cheng, T. C. E.
Zhang, Yunqing
Zhou, Guofei
DISCRETE APPLIED MATHEMATICS, 2014, 171 : 28 - 34
[2] The Ramsey numbers R(Cm, K7) and R(C7, K8)
Chen, Yaojun
Cheng, T. C. Edwin
Zhang, Yunqing
EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (05) : 1337 - 1352
[3] The cycle-complete graph Ramsey numbers R(C7, K9) and R(C8, K9)
Baniabedalruhman, A.
Alrifai, Ahmad
Al-Rhayyel, Ahmad A.
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2022, (48): : 325 - 335
[4] The cycle-complete graph Ramsey numbers R(C7, K9) and R(C8, K9)
Baniabedalruhman, A.
Alrifai, Ahmad
Al-Rhayyel, Ahmad A.
Italian Journal of Pure and Applied Mathematics, 2022, 48 : 325 - 335
[5] The cycle-complete graph Ramsey numbers R(C7, K9) and R(C8, K9)
Baniabedalruhman, A.
Alrifai, Ahmad
Al-Rhayyel, Ahmad A.
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, (48): : 325 - 335
[6] THE VALUE OF THE RAMSEY NUMBER R(3, 8)
MCKAY, BD
MIN, ZK
JOURNAL OF GRAPH THEORY, 1992, 16 (01) : 99 - 105
[7] THE CYCLE-COMPLETE GRAPH RAMSEY NUMBERS R(Cn, K8), FOR 10 ≤ n ≤ 15
Baniabedalruhman, A.
JORDAN JOURNAL OF MATHEMATICS AND STATISTICS, 2023, 16 (04): : 703 - 718
[8] K8 Hardy
Campbell, Andy
APERTURE, 2015, (218) : 104 - 109
[9] K8 HARDY
Duncan, David
ART IN AMERICA, 2009, 97 (10): : 193 - 194
[10] CONTRACTIONS TO K8
JORGENSEN, LK
JOURNAL OF GRAPH THEORY, 1994, 18 (05) : 431 - 448

← 1 2 3 4 5 →