Collapsibility bound for independence complexes of bounded-degree graphs
Statement
Let be a graph, and let denote its complex of independent sets of size at most . For a simplicial complex , let denote its collapsibility number. Let be a nonnegative integer and let be a positive integer.
Collapsibility conjecture. If has maximum degree at most , then
This is proposed as an extension of the Aharoni–Briggs–Kim–Kim conjecture. The bound is known for claw-free graphs, but the paper gives counterexamples in general, so the conjecture is refuted.
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.