The minimum oriented diameter bound in terms of vertex-cover number
Statement
Let be a bridgeless connected graph, and let denote its vertex-cover number. Define the minimum oriented diameter by
Minimum oriented diameter conjecture.
The paper proves the upper bound 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.