ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph on nn vertices, with n≥2n\ge 2, and consider its induced metric space using graph distance. A line is defined from metric betweenness, and a line is universal if it contains every vertex. Chvátal's line-count conjecture. The metric space induced by any connected graph on nn vertices either has a universal line or has Ω(n4/3)\Omega(n^{4/3}) lines. The paper proves the Chen–Chvátal conjecture for connected distance-hereditary graphs. The stronger bound above is known for 22-metric spaces, and hence for graphs of diameter two, but remains open for general connected graphs.

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.