Triple exponential bounds for monochromatic sums equal to products
Skip to main content
eScholarship
Open Access Publications from the University of California

Combinatorial Theory

Combinatorial Theory banner

Triple exponential bounds for monochromatic sums equal to products

Creative Commons 'BY' version 4.0 license
Abstract

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