The triangle-free lower-bound conjecture for zero forcing number
Statement
Let be a triangle-free graph with minimum degree .
Triangle-free zero-forcing conjecture.
This is the specialization of the broader girth–minimum-degree conjecture and concerns improving the trivial minimum-degree lower bound for triangle-free graphs. The paper presents it as a conjecture analogous to its proved bounds, but does not establish it in general.
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.