ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let In(G)I_n(G) denote its complex of independent sets of size at most nn. For a simplicial complex XX, let C(X)C(X) denote its collapsibility number. Let Δ\Delta be a nonnegative integer and let nn be a positive integer.

Collapsibility conjecture. If GG has maximum degree at most Δ\Delta, then

C(In(G))≤⌈Δ+12⌉(n−1).C(I_n(G))\leq\left\lceil\frac{\Delta+1}{2}\right\rceil(n-1).

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 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.