The independence–dissociation bound for connected triangle-free subcubic graphs
Statement
Let be a connected triangle-free subcubic graph. Write for its independence number and for its dissociation number, the maximum cardinality of a vertex set inducing a graph of maximum degree at most one. The independence–dissociation conjecture. One has
The conjecture proposes a sharp factor for comparing the independence number and dissociation number in triangle-free subcubic graphs; the stated bound is not established in 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.