Upper domination conjecture for direct products of complete multipartite graphs
Statement
Let denote the complete -partite graph with vertices in each part, and let be its direct product
Assume . The upper domination conjecture.
Here is the maximum size of a minimal dominating set of . The proposition preceding the conjecture proves the corresponding lower bound, and the equality is known when but remains open in general. A particularly attractive unresolved special case is .
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.