EUVIMEDEUVIMED entdecken
Open Access · CC0

Ramsey numbers of cycles versus multiple wheels

Zhaofa Wang, Yanbo Zhang

Filomat · 2025 · 39 (33) · 11961-11967

DOI: 10.2298/fil2533961w ↗

Kurz gefasst

Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Zhaofa Wang und 1 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For given graphs G and H, the Ramsey number R(G,H) is defined as the smallest positive integer N such that every red-blue edge-coloring of the complete graph \mathrm{K_N} contains either a red copy of G or a blue copy of H. We denote by \mathrm{C_n} the cycle on n vertices and by \mathrm{tW_{2m}} the disjoint union of t copies of the wheel \mathrm{W_{2m}} . We prove that for m ≥ 2 and n ≥ 4tm, R( \mathrm{C_n} , \mathrm{tW_{2m}} ) = 2n + t-2. This result generalizes previous findings by Surahmat, Baskoro, and Tomescu (Discrete Math., 2006), Chen, Cheng, Miao, and Ng (Appl. Math. Lett., 2009), Zhang, Broersma, and Chen (Graph Combin., 2015), as well as Sudarsana (Electron. J. Graph Theory Appl., 2021). Furthermore, the result confirms Sudarsana’s conjecture for wheels of odd order.

Zitieren

APA

Wang, Z., & Zhang, Y. (2025). Ramsey numbers of cycles versus multiple wheels. Filomat, 39(33), 11961-11967. https://doi.org/10.2298/fil2533961w

Vancouver

Wang Z, Zhang Y. Ramsey numbers of cycles versus multiple wheels. Filomat. 2025;39(33):11961-11967. doi:10.2298/fil2533961w

BibTeX
@article{Wang2025,
  author = {Wang, Zhaofa and Zhang, Yanbo},
  title = {Ramsey numbers of cycles versus multiple wheels},
  journal = {Filomat},
  year = {2025},
  volume = {39},
  number = {33},
  pages = {11961--11967},
  doi = {10.2298/fil2533961w}
}
Kostenlos starten →