Hansen–Li–Liu conjecture on the revised Szeged–Wiener difference for nonbipartite graphs
Statement
Let be a connected graph with vertices, edges, and an odd cycle. The Hansen–Li–Liu conjecture. asserts that
Moreover, the bound should be best possible, attained by the graph composed of a cycle on vertices, , and a tree on vertices sharing a single vertex. Here is the Wiener index and is the revised Szeged index. The conjecture proposes a sharp lower bound for their difference among connected nonbipartite graphs with at least as many edges as vertices.
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.