ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with maximum degree Δ≥2\Delta\geq 2. Write γ(G)\gamma(G) for its domination number and ir(G)ir(G) for its irredundance number. The asymptotic domination–irredundance conjecture.

γ(G)≤cΔir(G),\gamma(G)\leq c_{\Delta}ir(G),

where (cΔ)Δ≥2(c_{\Delta})_{\Delta\geq 2} is a strictly increasing sequence with

c2=1,cΔ⟶2as Δ⟶∞.c_2=1,\qquad c_{\Delta}\longrightarrow 2\quad\text{as }\Delta\longrightarrow\infty.

This conjecture generalizes the sharp subcubic bound discussed in the paper and predicts that the optimal coefficient approaches the general upper-bound threshold 22 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.