The isolation-number lower-bound conjectures
Statement
For a graph , let be the maximum number of pairwise disjoint -clique isolating sets in a partition of , and let be the analogous number for cycle isolating sets. The isolation-number lower-bound conjectures. (i) If and is connected with , then
(ii) If is connected with , then
These are explicitly stated to be equivalent to the two partition conjectures above, so they do not constitute additional independent claims.
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.