ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥3k \geq 3 be an integer. A kk-clique isolating set of a graph is a vertex set whose closed neighborhood leaves no copy of KkK_k. The partition conjecture. Every connected graph, except KkK_k, can be partitioned into k+1k+1 disjoint kk-clique isolating sets. This would imply the known upper bound ι(G,k)≤n/(k+1)\iota(G,k) \leq n/(k+1) for connected graphs G≆KkG \ncong K_k, and the paper studies this conjecture without resolving it.

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.