ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. An independent set SS is inclusion minimal if no proper subset of SS is independent with the same relevant property, and let d(S)d(S) and dc(G)d_c(G) denote the graph parameters used above. The claim concerns the number of inclusion minimal independent sets SS satisfying d(S)>0d(S)>0.

Minimum critical independent set count conjecture. The number of inclusion minimal independent sets SS such that d(S)>0d(S)>0 is greater than or equal to dc(G)d_c(G).

This conjecture is motivated by examples in which the number of such inclusion minimal independent sets is at least the critical independence parameter. Its status is not resolved by the supplied source context.

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.