The Theta-Complete Graph Ramsey Number R(θn, K7); n = 7; n ≥ 14.

Authors

  • A. Baniabedalruhman

Keywords:

Ramsey number; theta graph; complete graph.

Abstract

The Ramsey theory is an important branch in graph Theory. Finding the Ramsey number is an important topic in the Ramsey theory. The Ramsey number R(G,H) is the smallest positive integer n such that any graph of order n contains the graph G or its complement contains the graph H. In this paper, we prove that R(θn,K7) = 6(n − 1) + 1, n = 7; n ≥ 14, where θn is a theta graph of order n and K7 is the complete graph of order 7.

Key words and phrases. Ramsey number; theta graph; complete graph.

2000 Mathematics Subject Classification. 05C55, 05C35

Downloads

Published

2025-05-18

How to Cite

A. Baniabedalruhman. (2025). The Theta-Complete Graph Ramsey Number R(θn, K7); n = 7; n ≥ 14. Jordan Journal of Mathematics and Statistics, 14(3), 517–526. Retrieved from https://jjms.yu.edu.jo/index.php/jjms/article/view/798

Issue

Vol. 14 No. 3 (2021)

Section

Articles