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

A. Baniabedalruhman, M. M. M. Jaradat, M. S. Bataineh, A. M. M. Jaradat and R. U. Gobithaasan

Journal of Mathematics, 2024, vol. 2024, 1-6

Abstract: 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θn,K6;k≥6; n≥6, where θn is a theta graph of order n and K6 is the complete graph of order 6.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2024/2416730.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2024/2416730.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2416730

DOI: 10.1155/2024/2416730

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().