EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Triple exponential bounds for monochromatic sums equal to products

Matt Bowen

Combinatorial Theory · 20.08.2026 · 6 (2)

DOI: 10.5070/c6.68660 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Combinatorial Theory, online erschienen am 20.08.2026. Verfasst von Matt Bowen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We show that any \(r\)-coloring of \(\{1,\dots,r^{r^{r^{2r}}}\}\) contains monochromatic sets \(\{a,b,a+b,x,y,xy\}\) with \(a+b=xy.\) Mathematics Subject Classifications: 05D10 Keywords: Ramsey, sums equal to products

Zitieren

APA

Bowen, M. (2026). Triple exponential bounds for monochromatic sums equal to products. Combinatorial Theory, 6(2). https://doi.org/10.5070/c6.68660

Vancouver

Bowen M. Triple exponential bounds for monochromatic sums equal to products. Combinatorial Theory. 2026;6(2). doi:10.5070/c6.68660

BibTeX
@article{Bowen2026,
  author = {Bowen, Matt},
  title = {Triple exponential bounds for monochromatic sums equal to products},
  journal = {Combinatorial Theory},
  year = {2026},
  volume = {6},
  number = {2},
  doi = {10.5070/c6.68660}
}
Kostenlos starten →