We show that any finite affinely independent set can be isometrically embedded into a regular polygonal torus, that is, a finite product of regular polygons. As a consequence, with a straightforward application of Kříž’s theorem, we get an alternative proof of the fact that all finite affinely independent sets are Ramsey, a result which was originally proved by Frankl and Rödl. © The author
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
We show that for any k, m, p, c, if G is a Kk-free graph on N then there is an independent set of ve...
We show that any finite affinely independent set can be isometrically embedded into a regular polygo...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
AbstractA finite set X in some Euclidean space Rn is called Ramsey if for any k there is a d such th...
Is it possible to color R^2 with 2 colors in such a way that the vertices of any unit equilateral tr...
Ramsey theory is the study of unavoidable structure within a system. This idea is very broad, and al...
AbstractThe general Ramsey problem can be described as follows: Let A and B be two sets, and R a sub...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
AbstractIn this note we shall prove a geometric Ramsey theorem. Let T be a triangle with angles 30, ...
AbstractWe give a brief summary of several new results in Euclidean Ramsey theory, a subject which t...
Many important problems in combinatorics and other related areas can be phrased in the language of i...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
We show that for any k, m, p, c, if G is a Kk-free graph on N then there is an independent set of ve...
We show that any finite affinely independent set can be isometrically embedded into a regular polygo...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
AbstractA finite set X in some Euclidean space Rn is called Ramsey if for any k there is a d such th...
Is it possible to color R^2 with 2 colors in such a way that the vertices of any unit equilateral tr...
Ramsey theory is the study of unavoidable structure within a system. This idea is very broad, and al...
AbstractThe general Ramsey problem can be described as follows: Let A and B be two sets, and R a sub...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
AbstractIn this note we shall prove a geometric Ramsey theorem. Let T be a triangle with angles 30, ...
AbstractWe give a brief summary of several new results in Euclidean Ramsey theory, a subject which t...
Many important problems in combinatorics and other related areas can be phrased in the language of i...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
We investigate two combinatorial properties of classes of finite structures, as well as related appl...
We show that for any k, m, p, c, if G is a Kk-free graph on N then there is an independent set of ve...