EUVIMEDEUVIMED entdecken
Crossref

A lower bound on the Ramsey number R_k(k+1,k+1)

Pavel Pudlák, Vojtěch Rödl, William J. Wesley

Advances in Combinatorics · 24.04.2026

DOI: 10.19086/aic.2026.3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advances in Combinatorics, online erschienen am 24.04.2026. Verfasst von Pavel Pudlák und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We will prove that Rk(k +1,k +1) ≥ 4tw⌊k/4⌋−3(2), where tw is the tower function defined by tw1(x) = x and twi+1(x) = 2twi(x). We also give proofs of Rk(k+1,k+2) ≥ 4twk−7(2), Rk(k+1,2k+1) ≥ 4twk−3(2), and Rk(k+2,k+2) ≥ 4twk−4(2).

Zitieren

APA

Pudlák, P., Rödl, V., & Wesley, W. J. (2026). A lower bound on the Ramsey number R_k(k+1,k+1). Advances in Combinatorics. https://doi.org/10.19086/aic.2026.3

Vancouver

Pudlák P, Rödl V, Wesley WJ. A lower bound on the Ramsey number R_k(k+1,k+1). Advances in Combinatorics. 2026. doi:10.19086/aic.2026.3

BibTeX
@article{Pudlk2026,
  author = {Pudlák, Pavel and Rödl, Vojtěch and Wesley, William J.},
  title = {A lower bound on the Ramsey number R_k(k+1,k+1)},
  journal = {Advances in Combinatorics},
  year = {2026},
  doi = {10.19086/aic.2026.3}
}
Kostenlos starten →