AbstractThis note answers affirmatively the following question which appeared in a list of problems [3] generated by a July, 1977 Discrete Geometry conference at Oberwolfach: “Given 12 points in general position in space, can one always put them into 3 sets of 4 each so that the 3 tetrahedra have an interior point in common?” Related conjectures are considered
The problem we consider here arises quite naturally from Crum's Problem which asks: What is the maxi...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X ...
AbstractReay has conjectured that any set of(m − 1)(d + 1) + k + 1 points in general position in Rd ...
This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in ...
AbstractThe twelve point Desmic configuration in Euclidean three space is composed of three finite s...
AbstractA formula for the maximum number of cells formed by planes that dissect a tetrahedron throug...
AbstractTverberg’s 1966 theorem asserts that every set X of (m− 1)(d+ 1) + 1 points in Rdhas a parti...
AbstractA longstanding conjecture of Reay asserts that every set X of (m− 1)(d+ 1) +k+ 1 points in g...
AbstractReay’s conjecture asserts that every set of (m−1)(d+1)+k+1 points in general position in Rd ...
On the number of points in general position in the plane, Discrete Analysis 2018:16, 20 pp. A recur...
AbstractEvery set of six points in general position in space admits a partition into two sets of thr...
A finite point set in ?^d is in general position if no d + 1 points lie on a common hyperplane. Let ...
Erdős asked what is the maximum number α(n) such that every set of n points in the plane with no fou...
Combinatorial geometry is a broad and beautiful branch of mathematics. This PhD Thesis consists of t...
The problem we consider here arises quite naturally from Crum's Problem which asks: What is the maxi...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X ...
AbstractReay has conjectured that any set of(m − 1)(d + 1) + k + 1 points in general position in Rd ...
This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in ...
AbstractThe twelve point Desmic configuration in Euclidean three space is composed of three finite s...
AbstractA formula for the maximum number of cells formed by planes that dissect a tetrahedron throug...
AbstractTverberg’s 1966 theorem asserts that every set X of (m− 1)(d+ 1) + 1 points in Rdhas a parti...
AbstractA longstanding conjecture of Reay asserts that every set X of (m− 1)(d+ 1) +k+ 1 points in g...
AbstractReay’s conjecture asserts that every set of (m−1)(d+1)+k+1 points in general position in Rd ...
On the number of points in general position in the plane, Discrete Analysis 2018:16, 20 pp. A recur...
AbstractEvery set of six points in general position in space admits a partition into two sets of thr...
A finite point set in ?^d is in general position if no d + 1 points lie on a common hyperplane. Let ...
Erdős asked what is the maximum number α(n) such that every set of n points in the plane with no fou...
Combinatorial geometry is a broad and beautiful branch of mathematics. This PhD Thesis consists of t...
The problem we consider here arises quite naturally from Crum's Problem which asks: What is the maxi...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X ...