What is the least k=k(d) such that every simplicial d-polytope is weakly k-decomposable (respectively k-decomposable), while some simplicial d-polytope is not weakly…
Statement
What is the least k=k(d) such that every simplicial d-polytope is weakly k-decomposable (respectively k-decomposable), while some simplicial d-polytope is not weakly (k-1)-decomposable (respectively (k-1)-decomposable)?
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.