ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let m≥1m\geq 1 and k≥2k\geq 2, and let ww be an mm-weighting of GG. A kk-clique independent set is a set II of vertices such that every kk-clique of GG contains exactly one vertex of II. An mm-weighting w′w' is uniform on II when the weights assigned by w′w' to the vertices of II are equal. Weighted clique-packing conjecture. There exist a kk-clique independent set II of GG and an mm-weighting w′w' of GG uniform on II such that

πk(G(w′))≤πk(G(w)).\pi_k(G(w'))\leq\pi_k(G(w)).

for every mm-weighting ww of GG. The preceding theorems establish the analogous minimization statement for several graph classes, while the theorem for k=3k=3 shows that uniformity on all vertices need not attain the minimum; the conjecture proposes that uniformity on a suitable kk-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 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.