Fair splitting into arbitrarily many stable sets for colored paths
Statement
Let be a positive integer, and let be a path whose vertex set is partitioned into subsets , each of size at least . A subset of vertices is -stable if no two of its vertices are at distance less than , with distance counted in edges.
Fair stable-set splitting conjecture. There always exist pairwise disjoint -stable sets covering all vertices but in each , with sizes differing by at most one, and satisfying
for all and all .
This conjecture extends the paper's two-independent-set theorem to an arbitrary number of sets: when , -stable sets are precisely independent sets. Its resolution is not given in the supplied text.
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.