Unsolved Problems

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...

Problem Does there exist a dense set $S \subseteq {\mathbb R}^2$ so that all pairwise distances between points in $S$ are rational?...

Question What is the minimum cardinality of a decomposition of the $n$-cube into $n$-simplices?...

Conjecture If a finite set of unit balls in $\mathbb{R}^n$ is rearranged so that the distance between each pair of centers does not decrease, then the...

Conjecture Every set of $2^{n-2} + 1$ points in the plane in general position contains a subset of $n$ points which form a convex $n$-gon....

If $X \subseteq {\mathbb R}^2$ is a finite set of points which is 2-colored, an empty triangle is a set $T \subseteq X$ with $|T|=3$ so that the conve...

Question Is is possible to pack $n^n$ rectangular $n$-dimensional boxes each of which has side lengths $a_1,a_2,\ldots,a_n$ inside an $n$-dimensional ...

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...

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...

Problem Classify the point sets with no empty pentagon....

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....

Problem Enumerate all convex uniform 5-polytopes....

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 ...

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...

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$ ...

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 ...

Conjecture Associahedra have unbounded chromatic number....

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 ...

Conjecture Every convex polyhedron has a (nonoverlapping) edge unfolding....

Conjecture Let $k$ be a field of characteristic zero. A collection $f_1,\ldots,f_n$ of polynomials in variables $x_1,\ldots,x_n$ defines an automorphi...

Conjecture Let $X$ be a complex projective variety. Then every Hodge class is a rational linear combination of the cohomology classes of complex subva...

The fatness of a 4-polytope $P$ is defined to be $(f_1 + f_2)/(f_0 + f_3)$ where $f_i$ is the number of faces of $P$ of dimension $i$. Question Does ...

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$....

Conjecture For every positive integer $k$, there exists an integer $d$ so that every polytope of dimension $\ge d$ has a $k$-dimensional face which is...

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$...

Conjecture Every convex polytope has a non-overlapping edge unfolding....

We let $p(G)$ denote the pebbling number of a graph $G$. Conjecture $p(G_1 \Box G_2) \le p(G_1) p(G_2)$....

The deck of a graph $G$ is the multiset consisting of all unlabelled subgraphs obtained from $G$ by deleting a vertex in all possible ways (counted ac...

Conjecture Every simple graph with at least 4 edges is reconstructible from it's edge deleted subgraphs...

Let $G$ be a finite undirected simple graph. A $k$-page book embedding of $G$ consists of a linear order $\preceq$ of $V(G)$ and a (non-proper) $k$-c...

Problem What is the Shannon capacity of $C_7$?...

Question Is there a constant $c$ such that every $n$-vertex $K_t$-minor-free graph has at most $c^tn$ cliques?...

Given integers $k,n \ge 2$, the 2-stage Shuffle-Exchange graph/network, denoted $\text{SE}(k,n)$, is the simple $k$-regular bipartite graph with the o...

Conjecture If in a bridgeless cubic graph $G$ the cycles of any $2$-factor are odd, then $\omega(G)\leq 2$, where $\omega(G)$ denotes the oddness of t...

Problem ( $\dag$ ) Find a sufficient condition for a straight $\ell$-stage graph to be rearrangeable. In particular, what about a straight uniform gra...

Conjecture Can the approximation ratio $O(\sqrt{n})$ be improved for the Maximum Edge Disjoint Paths problem (MaxEDP) in planar graphs or can an inapp...

Conjecture Is the approximation ratio for the Maximum Edge Disjoint Paths (MaxEDP) or the Maximum Integer Multiflow problem (MaxIMF) bounded by a cons...

Conjecture It has been shown that a $k$-outerplanar embedding for which $k$ is minimal can be found in polynomial time. Does a similar result hold for...

Conjecture For $c \geq m \geq 1$, let $P(c,m)$ be the statement that given any exact $c$-coloring of the edges of a complete countably infinite graph ...

The star chromatic index $\chi_s'(G)$ of a graph $G$ is the minimum number of colors needed to properly color the edges of the graph so that no path o...

Conjecture Is it possible to color edges of the complete graph $K_n$ using $O(n)$ colors, so that the coloring is proper and no 4-cycle and no 4-edge ...

Conjecture Let $G$ be a graph and $k$ be a positive integer. The $k-$ power of $G$, denoted by $G^k$, is defined on the vertex set $V(G)$, by connecti...

Conjecture Given $k$ and $n$, the graph $C_{n}^k$ has equivalence covering number $\Omega(k)$....

Does there exist a planar graph with obstacle number greater than 1? Is there some $k$ such that every planar graph has obstacle number at most $k$?...

Question For every $d$ does there exists a $g$ such that every graph with average degree smaller than $d$ and girth at least $g$ has a matching-cut?...

Conjecture Let $n \geq 3$ be an integer and let $\alpha(n)$ denote the least integer $k$ such that there exists a simple graph on $k$ vertices having ...

Conjecture Every graph with maximum degree $\Delta \geq 9$ has chromatic number at most $\max\{\Delta-1, \omega\}$....

Conjecture Every digraph has a stable set meeting all longest directed paths...

Conjecture There exists an ineteger $k$ so that every $k$-arc-connected digraph contains a pair of arc-disjoint strongly connected spanning subdigraph...

Conjecture Do any three longest paths in a connected graph have a vertex in common?...