Polynomial Hirsch conjecture: for the family of superstrongly connected d-dimensional simplicial complexes with n vertices, there is a polynomial P in n and d that bounds the…
Statement
Polynomial Hirsch conjecture: for the family of superstrongly connected d-dimensional simplicial complexes with n vertices, there is a polynomial P in n and d that bounds the diameter of the dual graph of every member by P(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.