We show that the number of monochromatic solutions of the equation x 1 α1x2 α2⋯x r αr = g in a 2-coloring of a finite group G, where α1,...,αr are permutations and g ∈ G, depends only on the cardinalities of the chromatic classes but not on their distribution. We give some applications to arithmetic Ramsey statements.</p
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
AbstractSuppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such tha...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...
AbstractIn this article, we consider the relations between colourings and some equations in finite g...
We prove a density version for the Ramsey statement that, for fixed r and sufficiently large n, ever...
We prove a density version for the Ramsey statement that, for fixed r and sufficiently large n, ever...
Let G be a finite cyclic group an let r be a positive integer. Let A be a k×m matrix with integer en...
AbstractIn this article, we consider the relations between colourings and some equations in finite g...
Given an equation, the integers [n] = {1,2,...,n} as inputs, and the colors red and blue, how can we...
Counting monochromatic solutions to diagonal Diophantine equations, Discrete Analysis 2021:14, 47 pp...
AbstractIn 1929, Ramsey proved a theorem guaranteeing that if G1,G2,…,Gk are graphs, then there exis...
AbstractGiven graphs G and H, a coloring of E(G) is called an (H,q)-coloring if the edges of every c...
Ramsey's theorem, in the version of Erdo{double acute}s and Szekeres, states that every 2-coloring o...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
Let G = (G, ∗, e) be a finite group with support G = {g1, g2,..., gn}, op-eration ∗ and identity ele...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
AbstractSuppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such tha...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...
AbstractIn this article, we consider the relations between colourings and some equations in finite g...
We prove a density version for the Ramsey statement that, for fixed r and sufficiently large n, ever...
We prove a density version for the Ramsey statement that, for fixed r and sufficiently large n, ever...
Let G be a finite cyclic group an let r be a positive integer. Let A be a k×m matrix with integer en...
AbstractIn this article, we consider the relations between colourings and some equations in finite g...
Given an equation, the integers [n] = {1,2,...,n} as inputs, and the colors red and blue, how can we...
Counting monochromatic solutions to diagonal Diophantine equations, Discrete Analysis 2021:14, 47 pp...
AbstractIn 1929, Ramsey proved a theorem guaranteeing that if G1,G2,…,Gk are graphs, then there exis...
AbstractGiven graphs G and H, a coloring of E(G) is called an (H,q)-coloring if the edges of every c...
Ramsey's theorem, in the version of Erdo{double acute}s and Szekeres, states that every 2-coloring o...
AbstractFor integers n⩾1 and k⩾0, let Mk(n) represent the minimum number of monochromatic solutions ...
Let G = (G, ∗, e) be a finite group with support G = {g1, g2,..., gn}, op-eration ∗ and identity ele...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
AbstractSuppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such tha...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...