236 problems
Let be a decorated unicyclic graph with cycle length parameter , let be its curvature operator, and let denote the Perron metric. Write … and let be…
For integers and , let be sets, each of which is the union of exactly two disjoint, nonempty, closed convex sets. If, for e…
For each positive integer , let be the maximum, over all sets with , of the number of unordered pairs satisfying…
Does there exist an absolute constant such that, for every finite set with , the number of distinct pairwise distances satisfies…
Conjecture 1 (Lei and Bai). If is a Ricci-flat -regular graph, then is either isomorphic to or is a Cartesian product of the Petersen graph, the Triplex gr…
Let and consider a packing of circular disks whose radii all lie in an interval . Stability conjecture. There exists an such that, for eve…
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 satisfy , and let be the largest power of strictly less than . A sphere packing is weakly recurrent and dense when it has the corresponding recu…
Let congruent regular unit hexagons form an edge-to-edge connected system. Hexagon polyomino area bound. The area of its convex hull is at most … The statement is presented in…
Maximum colourful simplicial depth conjecture. The maximum colourful simplicial depth of any point in the interior of the core is
Let be the constructed polygonal surface and let conditions 1–7 be the preceding geometric and arithmetic conditions imposed in the construction of a sail for a periodic contin…
Maximum-score conjecture. The maximum of on is the constant
Let and let be finite sets of points in , with … for . A common convex-hull transversal is a -flat meeting ea…
Let be a natural number greater than , let be a natural number strictly less than , and let be another natural number. For the simplex consider…
Let denote the largest possible minimum area of a triangle determined by points in the unit square. Improved Heilbronn bound conjecture. There exists an…
Exponent conjecture for . For every fixed integer ,
Let be a finite point set. A visibility patch is a subset of a real cubic on which the relevant pairs of points are considered,…
Let be a finite planar point set. Two points of are visible if the open segment between them contains no other point of ; a mutually visible subset is…
Erdős–Falconer distance conjecture. If for a sufficiently large constant independent of , then
Let be the set of points in with integer coordinates satisfying , and let be the maximum size of a subset of containing…
The discrete filling-area density conjecture.
Let a finite planar point configuration be a finite set of points in the plane, where the closest neighbors of a point are the points minimizing Euclidean distance from it. Karabeg…
Boundary-point conjecture. For any optimal solution with at least nine points, each edge of the unit square contains exactly two points.
Asymptotic ball Davenport conjecture. For ,
Let be a bounded set, and let denote its discrete Borsuk partition number. Let be the convex hull of ,…