Kalai's Abstract Polynomial Hirsch Conjecture
Statement
Let be the collection of graphs whose vertices are labeled by -subsets of an -element set, with the property that for vertices labeled by and , there is a path between them all of whose vertex labels contain . Kalai's Abstract Polynomial Hirsch Conjecture (APHC). If is connected, then the diameter of is bounded above by a polynomial in and . This conjecture abstracts the Hirsch bound for polytope graphs and motivates an algebraic formulation through linear presentations of square-free monomial ideals; its resolution status is not specified in the source.
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.