ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G∈CG\in\mathcal{C} be a graph, and let domt(G){\rm dom}_t(G) and DOMt(G){\rm DOM}_t(G) denote its lower and upper orientable total domination numbers. For an orientation ff of GG, write GfG_f for the resulting oriented graph and γt(Gf)\gamma_t(G_f) for its total domination number. Intermediate-value conjecture. For every integer cc satisfying

domt(G)≤c≤DOMt(G),{\rm dom}_t(G)\leq c\leq {\rm DOM}_t(G),

there exists an orientation ff of GG such that

γt(Gf)=c.\gamma_t(G_f)=c.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.