ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let iso(G,k){\rm iso}(G,k) be the maximum number of pairwise disjoint kk-clique isolating sets in a partition of V(G)V(G), and let isoc(G){\rm iso}_c(G) be the analogous number for cycle isolating sets. The isolation-number lower-bound conjectures. (i) If k≥3k \geq 3 and GG is connected with G≆KkG \ncong K_k, then

iso(G,k)≥k+1.{\rm iso}(G,k) \geq k+1.

(ii) If GG is connected with G≆C3G \ncong C_3, then

isoc(G)≥4.{\rm iso}_c(G) \geq 4.

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 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.