Burcroff's irredundance conjecture for direct products of balanced complete multipartite graphs
Statement
Let be a direct product of balanced complete multipartite graphs. The independence number is the largest size of an independent set, and is the maximum size of an irredundant set. Burcroff's conjecture.
This strengthens the earlier conjecture that the independence number equals the upper domination number for these products. The conjecture is known in the cases and , but the source does not establish its general 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.