On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six
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 gr...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2024/2416730 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|