Given three graphs G, H and K we write K → (G, H), if in any red/blue coloring of the edges of K there exists a red copy of G or a blue copy of H. The Ramsey number r(G, H) is defined as the smallest natural number n such that Kn → (G, H) and the star-critical Ramsey number r∗(G, H) is defined as the smallest positive integer k such that Kn−1 ⊔ K1,k → (G, H), where n is the Ramsey number r(G, H). When n ≥ 3, we show that r∗(Cn, K4) = 2n except for r∗(C3, K4) = 8 and r∗(C4, K4) = 9. We also characterize all Ramsey critical r(Cn, K4) graphs.
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Department, Program, or Center
Computer Science (GCCIS)
Jayawardene, C. J., Narváez, D., & Radziszowski, S. P. (2021). Star-critical Ramsey numbers for cycles versus K_4. Discussiones Mathematicae Graph Theory, 41(2), 381. https://doi.org/10.7151/dmgt.2190
RIT – Main Campus