Some multivariable Rado numbers

Abstract

The Rado number of an equation is a Ramsey-theoretic quantity associated to the equation. Let E be a linear equation. Denote by Rr(E) the minimal integer, if it exists, such that any r-coloring of [1,Rr(E)] must admit a monochromatic solution to E. In this paper, we give upper and lower bounds for the Rado number of Σi=1m-2xi+kxm-1= xm, and some exact values are also given. Furthermore, we derive some results for the cases that =m=4 and m=5, =k+i \ (1≤ i≤ 5). As a generalization, the r-color Rado numbers for linear equations E1,E2,...,Er is defined as the minimal integer, if it exists, such that any r-coloring of [1,Rr(E1,E2,...,Er)] must admit a monochromatic solution to some Ei, where 1≤ i≤ r. A lower bound for Rr(E1,E2,...,Er) and the exact values of R2(x+y=z, x=y)=5k and R2(x+y=z, x+a=y) was given by Lov\'asz Local Lemma.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…