Three results on cycle-wheel Ramsey numbers

Yanbo Zhang, Haitze J. Broersma, Yaojun Chen

    Research output: Contribution to journalArticleAcademicpeer-review

    2 Citations (Scopus)
    97 Downloads (Pure)


    Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. We consider the case that G1 is a cycle and G2 is a (generalized) wheel. We expand the knowledge on exact values of Ramsey numbers in three directions: large cycles versus wheels of odd order; large wheels versus cycles of even order; and large cycles versus generalized odd wheels.
    Original languageUndefined
    Pages (from-to)2467-2479
    Number of pages13
    JournalGraphs and combinatorics
    Issue number6
    Publication statusPublished - Nov 2015


    • MSC-05C
    • EWI-26624
    • Cycle
    • IR-98922
    • Ramsey number
    • METIS-315119
    • Wheel

    Cite this