For d-polytopes with n facets, is the maximum graph diameter bounded by a polynomial in n (equivalently, for polytopes with 2d facets); can a family have diameter growing…
Statement
For d-polytopes with n facets, is the maximum graph diameter bounded by a polynomial in n (equivalently, for polytopes with 2d facets); can a family have diameter growing superlinearly in its number of facets; and does every d-polytope with n facets have diameter at most d(n-d)?
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.