ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bridgeless connected graph, and let γ(G)\gamma(G) denote its vertex-cover number. Define the minimum oriented diameter by

diam⟶min(G)=min⁡{diam(G→):G→ is an orientation of G}.\overset{\longrightarrow}{diam}_{min}(G)=\min\{diam(\overset{\rightarrow}{G}):\overset{\rightarrow}{G}\text{ is an orientation of }G\}.

Minimum oriented diameter conjecture.

Ξ(γ)=⌈7γ(G)+12⌉.\Xi(\gamma)=\left\lceil\frac{7\gamma(G)+1}{2}\right\rceil.

The paper proves the upper bound Ξ(γ)≤4γ\Xi(\gamma)\leq 4\gamma and presents the displayed formula as the expected true upper bound; its status is not resolved in the supplied text.

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.