A lower bound for certain Ramsey type problems (Q4802186)

A Diophantine equation over \({\mathbb N}\) (not containing 0) is \(r\)-regular if it possesses, for any disjoint partition of \({\mathbb N}\) into \(r\) colour classes, a monochromatic solution; if it is \(r\)-regular for all \(r\in{\mathbb N}\), the equation is regular. For non-zero integers \(a_1,\dots,a_n\), the Diophantine equation \(\sum_{i=1}^n\frac{a_i}{y_i}=0\) is shown in Theorem 2.1 to be regular if and only if there exists some non-empty subset of the \(a_i\)'s which sums to 0 [cf. \textit{H. Lefmann}, J. Comb. Theory, Ser. A 58, 35-53 (1991; Zbl 0746.05076); \textit{T. C. Brown} and \textit{V. Rödl}, Bull. Aust. Math. Soc. 43, 387-392 (1991; Zbl 0728.11017); \textit{S. D. Adhikari}, Expo. Math. 15, 367-371 (1997; Zbl 0892.11010)]. Defining \(f(r)\) to be the largest integer \(n\) such that no colouring of the integers \(1, 2, \dots, n\) yields a monochromatic solution to the equation \(\frac 1x+\frac 1y=\frac 1z\), they extend results of \textit{S. D. Adhikari} and \textit{R. Thangadurai} [Monochromatic solutions of Diophantine equations, in Algebraic number theory and diophantine analysis 1998, 1-9 (2000; Zbl 0958.11027)] as follows: Theorem 3.1. \(f(3)\geq 191.\) Theorem 3.2. For all \(n\in{\mathbb N}\), \(f(r+2)\geq 4\left(f(r)+\sqrt{\frac{f(r)}{5}}\right)\). Theorem 3.3. For every integer \(r\geq 3\), \(f(r)\geq 2^{r-3}\cdot 192-1\).