Extremality of disjoint unions of complete bipartite graphs for k-dominating independent sets
Statement
Let and let be divisible by . Consider -vertex graphs and the number of their -dominating independent sets.
Complete-bipartite-union conjecture. The maximum number of -dominating independent sets in an -vertex graph is attained by the disjoint union of copies of .
This proposes a concrete extremal family for all sufficiently large in the divisible-order case. The source gives no 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.