Liu–Zhang's edge bound in terms of maximum forcing number
Statement
Let be a finite simple graph of order with a perfect matching. Write for the number of edges of , and let denote its maximum forcing number. Liu–Zhang's conjecture. The graph satisfies
This conjecture proposes an improved lower bound on the number of edges in terms of the maximum forcing number; the supplied source does not indicate whether it has been resolved.
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.