AbstractEvery set of six points in general position in space admits a partition into two sets of three points each such that the circles determined by these triples are embracing. It also has a partition into two triples that are vertices of embracing triangles
AbstractA subset X in k-dimensional Euclidean space Rk that contains n points (elements) is called a...
AbstractIf each four spheres in a set of five unit spheres in R3 have nonempty intersection, then al...
We consider the problem of partitioning sets of n points in d dimensions by means of k intersecting ...
AbstractThis note answers affirmatively the following question which appeared in a list of problems ...
summary:We give an example of a set $P$ of $3n$ points in $\Bbb R 3$ such that, for any partition of...
AbstractWith respect to a collection of N + m + 1 points in Em and an integer k, 0 ⩽ k ⩽ N; a criter...
AbstractWe study the problem of partitioning point sets in the space so that each equivalence class ...
AbstractThere do not exist six points in the plane and six distinct congruent hyperbolas, each conta...
AbstractLet Rn be euclidean n-space with a cartesian coordinate system in which O is the origin. Let...
The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X ...
AbstractGiven 3n points in the unit square, n ⩾ 2, they determine n triangles whose vertices exhaust...
AbstractConsider the (n3) triangles determined by some n points in general position in 3-dimensional...
AbstractSuppose we are given three disjoint circles in the Euclidean plane with the property that no...
AbstractThe question of how often the same distance can occur between k distinct points in n-dimensi...
We say that a finite set of red and blue points in the plane in general position can be K1,3-covered...
AbstractA subset X in k-dimensional Euclidean space Rk that contains n points (elements) is called a...
AbstractIf each four spheres in a set of five unit spheres in R3 have nonempty intersection, then al...
We consider the problem of partitioning sets of n points in d dimensions by means of k intersecting ...
AbstractThis note answers affirmatively the following question which appeared in a list of problems ...
summary:We give an example of a set $P$ of $3n$ points in $\Bbb R 3$ such that, for any partition of...
AbstractWith respect to a collection of N + m + 1 points in Em and an integer k, 0 ⩽ k ⩽ N; a criter...
AbstractWe study the problem of partitioning point sets in the space so that each equivalence class ...
AbstractThere do not exist six points in the plane and six distinct congruent hyperbolas, each conta...
AbstractLet Rn be euclidean n-space with a cartesian coordinate system in which O is the origin. Let...
The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X ...
AbstractGiven 3n points in the unit square, n ⩾ 2, they determine n triangles whose vertices exhaust...
AbstractConsider the (n3) triangles determined by some n points in general position in 3-dimensional...
AbstractSuppose we are given three disjoint circles in the Euclidean plane with the property that no...
AbstractThe question of how often the same distance can occur between k distinct points in n-dimensi...
We say that a finite set of red and blue points in the plane in general position can be K1,3-covered...
AbstractA subset X in k-dimensional Euclidean space Rk that contains n points (elements) is called a...
AbstractIf each four spheres in a set of five unit spheres in R3 have nonempty intersection, then al...
We consider the problem of partitioning sets of n points in d dimensions by means of k intersecting ...
DOI
Add to ORKG