ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n,r∈Nn,r\in\mathbb{N} with rr dividing nn. Suppose that GG is a graph on nn vertices with degree sequence d1≤…≤dnd_1\leq\ldots\leq d_n satisfying the following conditions:

di≥(r−2)n/r+ifor all i<n/r;d_i\geq (r-2)n/r+i\quad\text{for all }i<n/r; dn/r+1≥(r−1)n/r.d_{n/r+1}\geq (r-1)n/r.

Balogh, Kostochka and Treglown's conjecture. Then GG contains a perfect KrK_r-tiling, that is, a collection of vertex-disjoint copies of KrK_r covering all vertices of GG.

This conjecture seeks a degree-sequence condition forcing a perfect HH-tiling that is best possible in a weaker sense than a Chvátal-type condition. It concerns the degree-sequence analogue of perfect clique-tiling results and remains open in the supplied source context.

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.