ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph, and let δ(G)\delta(G) denote its minimum degree. A graph is distance preserving if it has an isometric subgraph of every order from 11 to nn.

Minimum-degree conjecture. If

δ(G)>n/2,\delta(G)>n/2,

then GG is distance preserving.

Nussbaum and Esfahanian proved the stronger minimum-degree condition δ(G)≥2n/3−1\delta(G)\geq 2n/3-1, 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 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.