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!
|
| _version_ | 1850221903421112320 |
|---|---|
| author | A. Baniabedalruhman M. M. M. Jaradat M. S. Bataineh A. M. M. Jaradat |
| author_facet | A. Baniabedalruhman M. M. M. Jaradat M. S. Bataineh A. M. M. Jaradat |
| author_sort | A. Baniabedalruhman |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-717fd5cb7ae348239ed68f3052ccd08e |
| institution | OA Journals |
| issn | 2314-4785 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-717fd5cb7ae348239ed68f3052ccd08e2025-08-20T02:06:32ZengWileyJournal of Mathematics2314-47852024-01-01202410.1155/2024/2416730On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order SixA. Baniabedalruhman0M. M. M. Jaradat1M. S. Bataineh2A. M. M. Jaradat3Department of MathematicsDepartment of Mathematics, Statistics and PhysicsDepartment of MathematicsBasic Sciences DepartmentThe 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.http://dx.doi.org/10.1155/2024/2416730 |
| spellingShingle | A. Baniabedalruhman M. M. M. Jaradat M. S. Bataineh A. M. M. Jaradat On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six Journal of Mathematics |
| title | On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six |
| title_full | On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six |
| title_fullStr | On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six |
| title_full_unstemmed | On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six |
| title_short | On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six |
| title_sort | on the ramsey number for theta graphs versus the complete graph of order six |
| url | http://dx.doi.org/10.1155/2024/2416730 |
| work_keys_str_mv | AT abaniabedalruhman ontheramseynumberforthetagraphsversusthecompletegraphofordersix AT mmmjaradat ontheramseynumberforthetagraphsversusthecompletegraphofordersix AT msbataineh ontheramseynumberforthetagraphsversusthecompletegraphofordersix AT ammjaradat ontheramseynumberforthetagraphsversusthecompletegraphofordersix |