For integers k, n with k, n ≥ 1, the n-color weak Schur number WSk (n) is defined as the least integer N, such that for ...

La implantación de proyectos de infraestructura en zonas con alto riesgo geopolítico, como en el caso de los Territorios ...

In this study, we focus on the concept of the 2-color off-diagonal generalized weak Schur numbers, denoted as WS(2; k1, ...

Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x+y = z. We extend ...

Let k ≥ 3 be an integer, the Schur number Sk(3) is the least positive integer, such that for every 3-coloring of the integer ...

For integers k, n, c with k, n ≥ 1, and c ≥ 0, the n-color weak Rado number WRk (n, c) is defined as the least integer N, ...

Given any length k ≥ 3 and density 0 < δ ≤ 1, we introduce and study the set Sz(k, δ) consisting of all positive integers ...

Given k ≥ 1, the Fox–Kleitman conjecture from 2006 states that there exists a nonzero integer b such that the 2k-variable ...

We show that, for every positive integer r, there exists an integer b = b(r) such that the 4-variable quadratic Diophantine equation (x1 − y1)(x2 − y2) = b is r-regular. Our proof uses Szemerédi’s theorem on arithmetic progressions.

For integers k, n with k, n ≥ 1, the n-color weak Schur number W Sk(n) is defined as the least integer N, such that for ...

For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N if any, or ...

For integers k, n, c with k, n ≥ 1 and c ≥ 0, the n color weak Rado number W Rk(n, c) is defined as the least integer N, ...

For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N, if it exists ...

We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, ...

For any positive integers l and m, a set of integers is said to be (weakly) l-sum free modulo m if it contains no (pairwise ...

A set A of integers is weakly sum-free if it contains no three distinct elements x, y, z such that x + y = z. Given k ≥ ...

For graphs G1, . . . , Gs, the multicolor Ramsey number R(G1, . . . , Gs) is the smallest integer r such that if we give ...

En el presente artículo analizamos el proceso de adaptación a enseñanza virtual de las asignaturas del área de Matemática ...

This paper initiates a general study of the connection between graph homomorphisms and the Tutte polynomial. This connection ...

This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables ...

For each graph G the dimension of G is defined as the smallest dimension in the Euclidean Space where there is an embedding ...

F whic or h ev is ery p balanced, ositive in i.e., teger whose n ≡ 0 asso mod ciated 4, we Steinhaus construct ...

In this paper we compute the Frobenius number of certain Fibonacci numerical semigroups, that is, numerical semigroups generated by a set of Fibonacci numbers, in terms of Fibonacci numbers.

We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural ...

We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined by their Tutte polynomial, showing as an example how to apply this technique to the toroidal hexagonal tiling.

En eta memoria estudiamos diversos aspectos del polinomio de Tutte de una teselación regular. Comenzamos introduciendo ...

A graph is said to be locally grid if the structure around each of its vertices is a 3 × 3 grid. As a follow up of the ...

We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞, the canonical examples ...

El matemático alemán Euler (1707-1782) resolvió en 1736 el famoso problema de los puentes de Königsberg. Dicha ciudad ...