The degree-dependent partial-isolation bound conjecture
Statement
Let be a graph with maximum degree . For a positive integer , let denote the minimum size of a vertex set whose closed neighborhood leaves no induced copy of , and let denote the irredundance number. Let be the corresponding least upper bound of over graphs of maximum degree . The degree-dependent partial-isolation bound conjecture. For ,
where is a strictly decreasing sequence satisfying
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.