The plane-triangulation almost-completeness conjecture
Statement
Let be a set of points in general position, and let be the number of triangulations of the convex hull of using all points of . Plane-triangulation conjecture. The function is almost complete, meaning that it takes every positive integer except possibly finitely many values. The function has exponential growth, and the abundance of topological triangulations together with their planar realizability provides supporting evidence, but the conjecture remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.