DOIAbstract
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof all convex quasi-regular polyhedra are proved to be Ramsey
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof all convex quasi-regular polyhedra are proved to be Ramsey
We define what it means for an equation to be graph-regular, extending the idea of partition- regul...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
summary:We discuss dual Ramsey statements for several classes of finite relational structures (such ...
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...
We show that any finite affinely independent set can be isometrically embedded into a regular polygo...
AbstractThe general Ramsey problem can be described as follows: Let A and B be two sets, and R a sub...
Is it possible to color R^2 with 2 colors in such a way that the vertices of any unit equilateral tr...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
We show that any finite affinely independent set can be isometrically embedded into a regular polygo...
A polyhedron (3-dimensional polytope) is defined as a tessellation polyhedron if it possesses a net ...
We completely describe lattice convex polytopes in ℝ n (for any dimension n) that are regular with r...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
Ramsey theory is the study of unavoidable structure within a system. This idea is very broad, and al...
AbstractAn analog of Ramsey's theorem for regular trees is proved. The original theorem is a special...
We define what it means for an equation to be graph-regular, extending the idea of partition- regul...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
summary:We discuss dual Ramsey statements for several classes of finite relational structures (such ...
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...
We show that any finite affinely independent set can be isometrically embedded into a regular polygo...
AbstractThe general Ramsey problem can be described as follows: Let A and B be two sets, and R a sub...
Is it possible to color R^2 with 2 colors in such a way that the vertices of any unit equilateral tr...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
We show that any finite affinely independent set can be isometrically embedded into a regular polygo...
A polyhedron (3-dimensional polytope) is defined as a tessellation polyhedron if it possesses a net ...
We completely describe lattice convex polytopes in ℝ n (for any dimension n) that are regular with r...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
Ramsey theory is the study of unavoidable structure within a system. This idea is very broad, and al...
AbstractAn analog of Ramsey's theorem for regular trees is proved. The original theorem is a special...
We define what it means for an equation to be graph-regular, extending the idea of partition- regul...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
summary:We discuss dual Ramsey statements for several classes of finite relational structures (such ...
Add to ORKG