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
Ramsey Theorem, in the most simple form, states that if we are given a positive integer l, there exi...
AbstractThe general Ramsey problem can be described as follows: Let A and B be two sets, and R a sub...
We define what it means for an equation to be graph-regular, extending the idea of partition- regul...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
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...
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...
AbstractA finite set X in some Euclidean space Rn is called Ramsey if for any k there is a d such th...
In the last proposition of the Elements Euclid proved that there are only five regular polyhedra, na...
AbstractA regular polytope P is called locally projective if its minimal sections which are not sphe...
AbstractWe give a brief summary of several new results in Euclidean Ramsey theory, a subject which t...
AbstractIn this note we shall prove a geometric Ramsey theorem. Let T be a triangle with angles 30, ...
Regularity has often been present in the form of regular polyhedra or tessellations; classical examp...
Ramsey Theorem, in the most simple form, states that if we are given a positive integer l, there exi...
AbstractThe general Ramsey problem can be described as follows: Let A and B be two sets, and R a sub...
We define what it means for an equation to be graph-regular, extending the idea of partition- regul...
AbstractIn this paper it is shown that all regular polytopes are Ramsey. In the course of this proof...
AbstractThe question of when one regular polytope (finite, convex) embedds in the vertices of anothe...
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...
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...
AbstractA finite set X in some Euclidean space Rn is called Ramsey if for any k there is a d such th...
In the last proposition of the Elements Euclid proved that there are only five regular polyhedra, na...
AbstractA regular polytope P is called locally projective if its minimal sections which are not sphe...
AbstractWe give a brief summary of several new results in Euclidean Ramsey theory, a subject which t...
AbstractIn this note we shall prove a geometric Ramsey theorem. Let T be a triangle with angles 30, ...
Regularity has often been present in the form of regular polyhedra or tessellations; classical examp...
Ramsey Theorem, in the most simple form, states that if we are given a positive integer l, there exi...
AbstractThe general Ramsey problem can be described as follows: Let A and B be two sets, and R a sub...
We define what it means for an equation to be graph-regular, extending the idea of partition- regul...
DOI
Add to ORKG