Chvátal's line-count conjecture for graph metrics
Statement
Let be a connected graph on vertices, with , 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 vertices either has a universal line or has lines. The paper proves the Chen–Chvátal conjecture for connected distance-hereditary graphs. The stronger bound above is known for -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.