Bau–Dankelmann oriented diameter conjecture for bridgeless graphs
Statement
Let be a bridgeless graph of order and minimum degree , and let denote the minimum diameter over all strongly connected orientations of . Bau–Dankelmann's oriented diameter conjecture. There exists a constant such that
This conjecture asks for the asymptotically sharp upper bound suggested by the known lower bounds for bridgeless graphs. The paper proves an asymptotic result with coefficient and denominator , while the conjectured bound with denominator and an additive constant remains open.
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.