The minimum critical independent set count conjecture for graphs
Statement
Let be a graph. An independent set is inclusion minimal if no proper subset of is independent with the same relevant property, and let and denote the graph parameters used above. The claim concerns the number of inclusion minimal independent sets satisfying .
Minimum critical independent set count conjecture. The number of inclusion minimal independent sets such that is greater than or equal to .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.