ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 22-connected graph of order n≥10n\ge 10. Let KnK_n denote the complete graph, and let Kn2K_n^2 and Knn−2K_n^{n-2} be the graphs obtained from Kn−1K_{n-1} by adding one vertex adjacent to respectively 22 or n−2n-2 of the original vertices. Define η(G)=Sz⁡(G)−W(G)\eta(G)=\operatorname{Sz}(G)-W(G). Strengthened Szeged–Wiener conjecture. If GG is not isomorphic to KnK_n, Kn2K_n^2, or Knn−2K_n^{n-2}, then

η(G)≥2n.\eta(G)\ge 2n.

The conjecture is motivated by computer searches finding graphs with η(G)<2n\eta(G)<2n only up to order 99, with none on 1010 vertices. The source does not provide a proof or resolution, so the conjecture 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 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.