Abstract. In this paper we show that the Ramsey number [Math Processing Error] R ( C n , W m ) = 2 n - 1 for even m and [Math Processing Error] n ⩾ 5 m / 2 - 1 ...

Sep 13, 2016 · In 2014, Zhang, Zhang and Chen determined many of the Ramsey numbers R(C_{2k+1}, W_{n}) of odd cycles versus larger wheels, leaving open the ...

Ten years later Radziszowski and Xia [9] gave a simple and unified method to establish the Ramsey number R(G, C3), where G is either a path, a cycle or a wheel.

In 2014, Zhang, Zhang and Chen determined many of the Ramsey numbers R ( C 2 k + 1 , W n ) of odd cycles versus larger wheels, leaving open the particular case ...

This result solves the challenging problem of finding exact values of R where θ6 is the set of theta graphs of order 6 and W5 is the wheel graph of order 5.

The Ramsey Numbers of Large cycles Versus Odd Wheels ... For given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that for ...

Oct 22, 2024 · On this paper, we denote by W m for a wheel on m + 1 vertices. The notation tW m discribe a graph with t copies of wheels of order m + 1.

For given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that for every graph F of order N the following holds: either F.

Surahmat, Baskoro, E. T., & Broersma, H. J. (2002). The Ramsey numbers of large cycles versus small wheels. (Memorandum; No. 1634). University of Twente.

The Ramsey numbers of large cycles versus small wheels. Surahmat; Baskoro, ET; Broersma, HJ Integers (2004) Access Full Article