The k-Ramsey number of two five cycles
AbstractGiven any two graphs F and H, the Ramsey number R(F, H) is defined as the smallest positive integer n such that every red-blue coloring of the edges of the complete graph Kn of order n, there will be a subgraph of Kn isomorphic to F whose edges are all colored red (a red F) or a subgraph of...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2024-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2023.2250839 |