EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Computational Lower Bounds for Wheel Ramsey Numbers

Sergey Bereg

Mathematics · 30.06.2026 · 14 (13) · 2310

DOI: 10.3390/math14132310 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 30.06.2026. Verfasst von Sergey Bereg. Die Arbeit nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study small off-diagonal Ramsey numbers involving wheel graphs. Following Radziszowski’s convention, we write Wn=K1+Cn−1 for the wheel on n vertices. A lower bound for R(Wm,Wn) is certified by a graph G such that G is Wm-free and G¯ is Wn-free. We conduct computational experiments using several complementary search techniques, including partial Ramsey colorings and local search procedures. The computations exploit the structure of wheels: G contains Wn if and only if some vertex neighborhood contains a cycle Cn−1. We report new lower-bound constructions for three off-diagonal wheel Ramsey numbers and provide the corresponding Ramsey graphs as explicit certificates.

Zitieren

APA

Bereg, S. (2026). Computational Lower Bounds for Wheel Ramsey Numbers. Mathematics, 14(13), 2310. https://doi.org/10.3390/math14132310

Vancouver

Bereg S. Computational Lower Bounds for Wheel Ramsey Numbers. Mathematics. 2026;14(13):2310. doi:10.3390/math14132310

BibTeX
@article{Bereg2026,
  author = {Bereg, Sergey},
  title = {Computational Lower Bounds for Wheel Ramsey Numbers},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {13},
  pages = {2310},
  doi = {10.3390/math14132310}
}
Kostenlos starten →