On Three Sets with Nondecreasing Diameter
Abstract
Let [a,b] denote the integers between a and b inclusive and, for a finite subset X ⊂eq Z, let the diameter of X be equal to (X)-(X). We write X<p\,Y provided (X)<(Y). For a positive integer m, let f(m,m,m;2) be the least integer N such that any 2-coloring : [1, N]→ \0,1\ has three monochromatic m-sets B1, B2, B3 ⊂eq [1,N] (not necessarily of the same color) with B1<p\, B2 <p\, B3 and diam(B1)≤ diam(B2)≤ diam(B3). Improving upon upper and lower bounds of Bialostocki, Erd os and Lefmann, we show that f(m,m,m;2)=8m-5+2m-23+δ for m≥ 2, where δ=1 if m∈ \2,5\ and δ=0 otherwise.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.