Path extremal conjecture for zero forcing sets of fixed size
Statement
Let be an -vertex graph, and let denote the number of zero forcing sets of having size . Let be the path on vertices. Fixed-size zero forcing conjecture. If is an -vertex graph, then for all ,
This conjecture would imply the path extremal conjecture for the probability that a random vertex set is zero forcing, via the expansion of that probability in terms of the numbers . The paper presents it as a stronger conjecture and does not establish it.
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.