On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six

被引：0

作者：

Baniabedalruhman, A. ^{[1
]}

Jaradat, M. M. M. ^{[2
]}

Bataineh, M. S. ^{[1
,3
]}

Jaradat, A. M. M. ^{[4
]}

机构：

[1] Yarmouk Univ, Dept Math, Irbid, Jordan

[2] Qatar Univ, Dept Math Stat & Phys, Doha, Qatar

[3] Univ Sharjah, Dept Math, Sharjah, U Arab Emirates

[4] Princess Sumaya Univ Technol, Basic Sci Dept, Amman, Jordan

来源：

JOURNAL OF MATHEMATICS | 2024年 / 2024卷

关键词：

CYCLE; R(THETA(N); R(C-M; K-7);

D O I：

10.1155/2024/2416730

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The Ramsey number rG,H is the smallest positive integer n such that any graph W of order n contains G as a subgraph or its complement contains H as a subgraph. In this paper, we find the exact value for the Ramsey number r theta n,K6;k >= 6; n >= 6, where theta n is a theta graph of order n and K6 is the complete graph of order 6.

引用

页数：6

共 29 条

[1] Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory [J].