ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bridgeless graph of order nn and minimum degree δ≥2\delta\geq 2, and let diam⁡→(G)\overrightarrow{\operatorname{diam}}(G) denote the minimum diameter over all strongly connected orientations of GG. Bau–Dankelmann's oriented diameter conjecture. There exists a constant CC such that

diam⁡→(G)≤3nδ+1+C.\overrightarrow{\operatorname{diam}}(G) \leq \frac{3n}{\delta+1}+C.

This conjecture asks for the asymptotically sharp upper bound suggested by the known lower bounds for bridgeless graphs. The paper proves an asymptotic result with coefficient 3+epsilon3+epsilon and denominator δ−2\delta-2, while the conjectured bound with denominator δ+1\delta+1 and an additive constant 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.