ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers nn and dd with 2≤d≤n−22\leq d\leq n-2, let m(n,d)m(n,d) be the minimum number mm such that every bridgeless graph of order nn and size at least mm has an orientation of diameter at most dd.

Conjecture on m(n,d)m(n,d).

m(n,d)=(n−d2)+n+2.m(n,d)={n-d\choose 2}+n+2.

The formula is known for d=2d=2 and d=n−2d=n-2, while the general case remains open; the paper proves the lower bound for 5≤d≤n−25\leq d\leq n-2.

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.