The minimum-degree conjecture for distance-preserving graphs
Statement
Let be an -vertex graph, and let denote its minimum degree. A graph is distance preserving if it has an isometric subgraph of every order from to .
Minimum-degree conjecture. If
then is distance preserving.
Nussbaum and Esfahanian proved the stronger minimum-degree condition , so the conjecture remains open in the stated range.
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.