The weighted clique-packing conjecture for uniform weights on a clique independent set
Statement
Let be a graph, let and , and let be an -weighting of . A -clique independent set is a set of vertices such that every -clique of contains exactly one vertex of . An -weighting is uniform on when the weights assigned by to the vertices of are equal. Weighted clique-packing conjecture. There exist a -clique independent set of and an -weighting of uniform on such that
for every -weighting of . The preceding theorems establish the analogous minimization statement for several graph classes, while the theorem for shows that uniformity on all vertices need not attain the minimum; the conjecture proposes that uniformity on a suitable -clique independent set always suffices.
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.