Unsolved Problems
Showing 1-37 of 37 problems
Erdős-Szekeres with Visibility
Fix integers $k, \ell$. Given $n \geq n_0(k, \ell)$ points in $\mathbb{R}^2$, is there either a line containing $k$ of them, or $\ell$ of them that ar...
Collinear 4-tuples Force Collinear 5-tuples
Suppose $A \subset \mathbb{R}^2$ is a set of size $n$ with $cn^2$ collinear 4-tuples. Does it contain 5 points on a line?...
No 5 Points on 2-plane in [N]^d
What is the largest subset of $[N]^d$ with no 5 points on a 2-plane?...
Balanced Ham Sandwich Line
Let $X \subset \mathbb{R}^2$ be a set of $n$ points. Does there exist a line $\ell$ through at least two points of $X$ such that the numbers of points...
Sparse Hitting Set for Rectangles
Let $A$ be a set of $n$ points in the plane. Can one select $A' \subset A$ of size $n/2$ such that any axis-parallel rectangle containing 1000 points ...
Axis-Parallel Rectangles in Dense Sets
Suppose $A$ is an open subset of $[0, 1]^2$ with measure $\alpha$. Are there four points in $A$ determining an axis-parallel rectangle with area $\geq...
Pyjama Set Covering
How many rotated (about the origin) copies of the "pyjama set" $\{(x, y) \in \mathbb{R}^2 : \operatorname{dist}(x, \mathbb{Z}) \leq \varepsilon\}$ are...
Erdős Problem #98
Let $h(n)$ be such that any $n$ points in $\mathbb{R}^2$, with no three on a line and no four on a circle, determine at least $h(n)$ distinct distance...
Erdős Problem #100
Let $A$ be a set of $n$ points in $\mathbb{R}^2$ such that all pairwise distances are at least $1$ and if two distinct distances differ then they diff...
Erdős Problem #103
Let $h(n)$ count the number of incongruent sets of $n$ points in $\mathbb{R}^2$ which minimise the diameter subject to the constraint that $d(x,y)\geq...
Erdős Problem #507
Let $\alpha(n)$ be such that every set of $n$ points in the unit disk contains three points which determine a triangle of area at most $\alpha(n)$. Es...
Erdős Problem #652
Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\#\{ \lvert x_j-x_i\rvert : j eq i\}$, where the points are ordered such that $ R(x_1)\leq \cdots...
Erdős Problem #653
Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\#\{ \lvert x_j-x_i\rvert : j eq i\}$, where the points are ordered such that $ R(x_1)\leq \cdots...
Erdős Problem #655
Let $x_1,\ldots,x_n\in \mathbb{R}^2$ be such that no circle whose centre is one of the $x_i$ contains three other points. Are there at least $ (1+c)\f...
Erdős Problem #661
Are there, for all large $n$, some points $x_1,\ldots,x_n,y_1,\ldots,y_n\in \mathbb{R}^2$ such that the number of distinct distances $d(x_i,y_j)$ is $...
Erdős Problem #662
Consider the triangular lattice with minimal distance between two points $1$. Denote by $f(t)$ the number of distances from any points $\leq t$. For e...
Erdős Problem #669
Let $F_k(n)$ be minimal such that for any $n$ points in $\mathbb{R}^2$ there exist at most $F_k(n)$ many distinct lines passing through at least $k$ o...
Erdős Problem #831
Let $h(n)$ be maximal such that in any $n$ points in $\mathbb{R}^2$ (with no three on a line and no four on a circle) there are at least $h(n)$ many c...
Erdős Problem #1129
For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...
A conjecture on iterated circumcentres
Conjecture Let $p_1,p_2,p_3,\ldots$ be a sequence of points in ${\mathbb R}^d$ with the property that for every $i \ge d+2$, the points $p_{i-1}, p_{i...
Big Line or Big Clique in Planar Point Sets
Let $S$ be a set of points in the plane. Two points $v$ and $w$ in $S$ are visible with respect to $S$ if the line segment between $v$ and $w$ contain...
Average diameter of a bounded cell of a simple arrangement
Conjecture The average diameter of a bounded cell of a simple arrangement defined by $n$ hyperplanes in dimension $d$ is not greater than $d$....
Convex 'Fair' Partitions Of Convex Polygons
Basic Question: Given any positive integer n, can any convex polygon be partitioned into n convex pieces so that all pieces have the same area and sam...
Edge-Colouring Geometric Complete Graphs
Question What is the minimum number of colours such that every complete geometric graph on $n$ vertices has an edge colouring such that: \item[Varian...
Partition of Complete Geometric Graph into Plane Trees
Conjecture Every complete geometric graph with an even number of vertices has a partition of its edge set into plane (i.e. non-crossing) spanning tree...
Point sets with no empty pentagon
Problem Classify the point sets with no empty pentagon....
Covering a square with unit squares
Conjecture For any integer $n \geq 1$, it is impossible to cover a square of side greater than $n$ with $n^2+1$ unit squares....
Convex uniform 5-polytopes
Problem Enumerate all convex uniform 5-polytopes....
Partitioning the Projective Plane
Throughout this post, by projective plane we mean the set of all lines through the origin in $\mathbb{R}^3$. Definition Say that a subset $S$ of the ...
Dirac's Conjecture
Conjecture For every set $P$ of $n$ points in the plane, not all collinear, there is a point in $P$ contained in at least $\frac{n}{2}-c$ lines determ...
General position subsets
Question What is the least integer $f(n)$ such that every set of at least $f(n)$ points in the plane contains $n$ collinear points or a subset of $n$ ...
Generalised Empty Hexagon Conjecture
Conjecture For each $\ell\geq3$ there is an integer $f(\ell)$ such that every set of at least $f(\ell)$ points in the plane contains $\ell$ collinear ...
Chromatic number of associahedron
Conjecture Associahedra have unbounded chromatic number....
Convex Equipartitions with Extreme Perimeter
To divide a given 2D convex region C into a specified number n of convex pieces all of equal area (perimeters could be different) such that the total ...
Edge-Unfolding Convex Polyhedra
Conjecture Every convex polyhedron has a (nonoverlapping) edge unfolding....
Continous analogue of Hirsch conjecture
Conjecture The order of the largest total curvature of the primal central path over all polytopes defined by $n$ inequalities in dimension $d$ is $n$....
Extension complexity of (convex) polygons
The extension complexity of a polytope $P$ is the minimum number $q$ for which there exists a polytope $Q$ with $q$ facets and an affine mapping $\pi$...