The asymptotic domination–irredundance bound conjecture
Statement
Let be a graph with maximum degree . Write for its domination number and for its irredundance number. The asymptotic domination–irredundance conjecture.
where is a strictly increasing sequence with
This conjecture generalizes the sharp subcubic bound discussed in the paper and predicts that the optimal coefficient approaches the general upper-bound threshold as the maximum degree grows. The supplied text gives no resolution evidence, so its status remains open.
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.