ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G′(k,n){\mathcal G}'(k,n) be the collection of graphs whose vertices are labeled by kk-subsets of an nn-element set, with the property that for vertices labeled by SS and TT, there is a path between them all of whose vertex labels contain S∩TS\cap T. Kalai's Abstract Polynomial Hirsch Conjecture (APHC). If G∈G(k,n)G\in {\mathcal G}(k,n) is connected, then the diameter of GG is bounded above by a polynomial in kk and nn. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.