Aouchiche–Hansen–Zheng conjecture on the Randić index and matching number
Statement
Let be a connected graph on vertices, where . Write for its Randić index and let denote its matching number. Define
Aouchiche–Hansen–Zheng conjecture. One has
with equality if and only if .
The conjecture proposes the extremal connected graph for the difference between the Randić index and matching number. It was disproved by the existence of a counterexample; the corresponding restricted extremal problem for subcubic graphs was solved by Du, Hu, and collaborators.
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.