Vertex-deletion conjecture for the upper orientable total domination number
Statement
Let be a graph in and let be such that . Vertex-deletion conjecture.
The conjecture proposes the missing lower bound from the cited vertex-deletion result; the corresponding upper bound for induced subgraphs is known, but this inequality was not proved in the paper.
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.