Conjectured edge threshold for bounded-diameter orientations of bridgeless graphs
Statement
For integers and with , let be the minimum number such that every bridgeless graph of order and size at least has an orientation of diameter at most .
Conjecture on .
The formula is known for and , while the general case remains open; the paper proves the lower bound for .
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.