Kurz–Lätsch conjecture on oriented diameter and domination number
Statement
Let be a bridgeless graph, and let be its domination number, where a dominating set is a vertex set such that every vertex in is adjacent to at least one vertex of . Write for the oriented diameter of .
Kurz–Lätsch conjecture. For every bridgeless graph with ,
Kurz and Lätsch had previously proved the upper bound . Their conjecture seeks a sharper universal bound in terms of the domination number; the supplied source gives no resolution.
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.