论文信息 - Multiplicity of monochromatic solutions to x+yz

Multiplicity of monochromatic solutions to x+yz

For integers n>=1 and k>=0, let M"k(n) represent the minimum number of monochromatic solutions to x+y=0, M"k(n)=Cn^3(1+o"k(1)), where C=112(1+22)^2~0.005686. A structural result is also proven, which can be used to determine the exact value of M"k(n) for given k and n.

[1] Wojciech Kosek,et al. Rado Numbers for the Equation ∑i = 1m - 1 xi + c = xm, for Negative Values of c , 2001, Adv. Appl. Math..

[2] A. Street,et al. Combinatorics: room squares, sum-free sets, Hadamard matrices , 1972 .

[3] Boris A. Datskovsky. On the number of monochromatic Schur triples , 2003, Adv. Appl. Math..

[4] J. Spencer. Ramsey Theory , 1990 .

[5] Aaron Robertson,et al. Ramsey Theory on the Integers , 2014 .

[6] Daniel Schaal,et al. On a Variation of Schur Numbers , 2000, Graphs Comb..

[7] R. Rado,et al. Studien zur Kombinatorik , 1933 .

[8] Tomasz Schoen. The Number of Monochromatic Schur Triples , 1999, Eur. J. Comb..

[9] Vojtech Rödl,et al. On Schur Properties of Random Subsets of Integers , 1996 .

[10] Walter A. Deuber. Surveys in Combinatorics, 1989: Developments based on Rado's dissertation ‘Studien zur Kombinatorik’ , 1989 .

[11] Doron Zeilberger,et al. A 2-Coloring of [1, N] Can Have (1/22)N2+O(N) Monochromatic Schur Triples, But Not less! , 1998, Electron. J. Comb..

[12] B. Bollobás. Surveys in Combinatorics , 1979 .