ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f2(n)f_2(n) denote the minimum number of arcs in an oriented graph with weak diameter 22 on nn vertices, and let xnx_n be the upper bound constructed in the paper. An oriented clique is an oriented graph in which every pair of distinct vertices is joined by a directed path of length at most 22 in one direction. Exact formula conjecture. For all n∈Nn \in \mathbb{N}, f2(n)=xnf_2(n)=x_n. The authors found equality computationally for small values of nn; proving the formula would establish that their construction is optimal for every nn.

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.