The exact formula conjecture for the minimum arc count of oriented cliques
Statement
Let denote the minimum number of arcs in an oriented graph with weak diameter on vertices, and let 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 in one direction. Exact formula conjecture. For all , . The authors found equality computationally for small values of ; proving the formula would establish that their construction is optimal for every .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.