ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n,r∈Nn,r\in\mathbb N with rr dividing nn. Let GG be a graph on nn vertices with degree sequence d1≤⋯≤dnd_1\leq\dots\leq d_n. Balogh, Kostochka and Treglown's conjecture. If

di≥(r−2)n/r+id_i\geq (r-2)n/r+i

for all i<n/ri<n/r, and

dn/r+1≥(r−1)n/r,d_{n/r+1}\geq (r-1)n/r,

then GG contains a perfect KrK_r-packing. A perfect KrK_r-packing is a collection of vertex-disjoint copies of KrK_r covering all vertices of GG. This conjecture proposes a degree-sequence analogue of the Hajnal–Szemerédi theorem, characterising sufficient degree conditions for a perfect clique packing; its resolution status is not specified in the source.

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.