Intermediate-value conjecture for orientable total domination numbers
Statement
Let be a graph, and let and denote its lower and upper orientable total domination numbers. For an orientation of , write for the resulting oriented graph and for its total domination number. Intermediate-value conjecture. For every integer satisfying
there exists an orientation of such that
This extends the corresponding result known for complete graphs and complete bipartite graphs. The source attributes the conjecture to the authors of the cited earlier work, and no resolution is given here.
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.