97 problems
Let be positive integers. Given sets , each consisting of points of , consider partitions of their union into sets…
Let be a lattice polytope of dimension and degree . A Cayley polytope is a lattice polytope expressible as a Cayley sum of lattice polytopes. Cayley c…
Big-Line-Big-Clique Conjecture. For all integers and there is an integer such that every finite set of at least points in the plane either contains co…
Let and be positive integers, and let denote the number of points under consideration. Birch's conjecture. Any points in can be partitio…
Let be a simple arrangement of pairwise intersecting pseudocircles, and let denote the number of triangular cells. Triangle lower-bound conjectu…
Let be a simple digon-free arrangement of pairwise intersecting circles, and let denote the number of triangular cells. Weak Grünbaum triangle conjec…
Let be families of points each in , considered as color classes. A colorful partition is a partition into sets such that…
Let be a fixed positive integer, and let a family consist of pairwise intersecting bi-infinite -monotone curves such that any two curves intersect at most times. Lin…
Let be a dense -element point set in general position in the plane, and let denote the complete geometric graph induced by . A path is monotone if its edge set i…
Let be an even set of points in the plane, and let be a max-sum matching of . Define as the minimum, over points in the plane, of…
Let be an even set of points in the plane, and let be a max-sum matching of , where . A point is required to satisfy, for every matched…
Let be the triangular lattice. A configuration is -optimal if it has the maximum pos…
Symmetric six-tuple conjecture. All symmetric six-tuples are solutions of Problem 1.
Middle-regime doubling conjecture. For every and every in this middle regime,
Tree--necklace Gauss-load conjecture. For tree-like and tree--necklace shadows, the minimum Gauss load is obtained by a reduced tangent-angle realization of a coorientation minimiz…
Let a family of planar curves be precisely 1-intersecting if every pair of curves has precisely one common point, either a crossing or a tangency, and assume that no three curves s…
Let blue points, no three on a line, and red points disjoint from the blue points be given. Assume that every line through two blue points contains a red point. Milićević's…
Let be a non-collinear set of two-colored points, and suppose that no line contains more than points, where . Böröczky extremality conjecture. For e…
Blue-polygon bichromatic-face conjecture. Given a blue -gon with at least red pseudolines passing through, there exists a bichromatic triangle or quadrangle on its ins…
Triangle-pseudoline incidence graph conjecture. The triangle-pseudoline incidence graph of a pseudoline arrangement is connected.
Björner–Las Vergnas–Sturmfels–White–Ziegler conjecture. Every bicolored arrangement has a bichromatic triangle.
Central-slice extremality conjecture. For every centrally symmetric -dimensional polytope , the upper bound on the number of vertices of a -dimensional slice of is…
Generic central slice conjecture. The upper bound on the number of vertices of a -dimensional slice of can be attained by a generic central -dimensional slice for every…
Let an -distance set be a set of points whose pairwise distances take at most values. The multiplicity of a distance is the number of unordered pairs of points in the set re…
Let a triangular lattice be the set of points with coordinates , where . Consider a regular hexagon or an equiangular hexagon w…