The partition conjecture for k-clique isolating sets
Statement
Let be an integer. A -clique isolating set of a graph is a vertex set whose closed neighborhood leaves no copy of . The partition conjecture. Every connected graph, except , can be partitioned into disjoint -clique isolating sets. This would imply the known upper bound for connected graphs , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.