ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph with n≥4n \geq 4 vertices, m≥nm \geq n edges, and an odd cycle. The Hansen–Li–Liu conjecture. asserts that

Sz∗(G)−W(G)≥n2+4n−64.Sz^*(G)-W(G) \geq \frac{n^2+4n-6}{4}.

Moreover, the bound should be best possible, attained by the graph composed of a cycle on 33 vertices, C3C_3, and a tree TT on n−3n-3 vertices sharing a single vertex. Here W(G)W(G) is the Wiener index and Sz∗(G)Sz^*(G) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.