On the degree of regularity of generalized van der Waerden triples
Nikos Frantzikinakis, Bruce Landman, Aaron Robertson
Abstract
Let 1 ≤ a ≤ b be integers. A triple of the form (x,ax+d,bx+2d), where x,d are positive integers is called an (a,b)-triple. The degree of regularity of the family of all (a,b)-triples, denoted dor(a,b), is the maximum integer r such that every r-coloring of N admits a monochromatic (a,b)-triple. We settle, in the affirmative, the conjecture that dor(a,b) < ∞ for all (a,b) ≠ (1,1). We also disprove the conjecture that dor(a,b) ∈ \1,2,∞\ for all (a,b).
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell