Upper bound on the change in positive semidefinite leaky forcing under edge deletion
Statement
Let be a graph and let be an edge. Write for the graph obtained by deleting , and let denote the positive semidefinite -leaky forcing number of . Edge-deletion conjecture. For every graph and every edge ,
The conjecture gives an upper bound complementary to the proved lower bound in Proposition cited in the surrounding discussion. It was computationally verified for all connected graphs through order eight, but the general case remains open.
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.