Let C(d,n) be the maximum number of facets of a cubical d-polytope with n vertices, and let t(n) be the maximum number of triangles in R^3 with vertices in an n-point set such…
Statement
Let C(d,n) be the maximum number of facets of a cubical d-polytope with n vertices, and let t(n) be the maximum number of triangles in R^3 with vertices in an n-point set such that any two triangles intersect only in a common vertex or not at all. Determine the growth of C(d,n) and t(n); in particular, is C(d,n)=o(n^2) for every fixed d, and how large can t(n) be?
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.