ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with maximum degree Δ\Delta. For a positive integer kk, let ιk(G)\iota_k(G) denote the minimum size of a vertex set whose closed neighborhood leaves no induced copy of KkK_k, and let ir(G)ir(G) denote the irredundance number. Let cΔ(k)c_{\Delta}(k) be the corresponding least upper bound of ιk(G)/ir(G)\iota_k(G)/ir(G) over graphs of maximum degree Δ\Delta. The degree-dependent partial-isolation bound conjecture. For 1≤k≤Δ1\leq k\leq \Delta,

ιk(G)≤cΔ(k)ir(G),\iota_k(G)\leq c_{\Delta}(k)ir(G),

where cΔ(1),cΔ(2),…,cΔ(Δ)c_{\Delta}(1),c_{\Delta}(2),\ldots,c_{\Delta}(\Delta) is a strictly decreasing sequence satisfying

1≤cΔ(k)<2.1\leq c_{\Delta}(k)<2.

The conjecture proposes a degree-dependent hierarchy of bounds interpolating between partial isolation and irredundance. 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.