ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥2k\ge 2 and let GG be a kk-partite graph with parts V1,…,VkV_1,\ldots,V_k of the same size nn. Define the partite minimum degree of GG to be the largest integer dd such that every vertex has at least dd neighbors in each part other than its own. A perfect KkK_k-packing is a collection of vertex-disjoint kk-cliques covering all vertices of GG. Fischer–Kühn–Osthus's conjecture. If the partite minimum degree of GG is at least (1−1k)n\left(1-\frac{1}{k}\right)n, then GG has a perfect KkK_k-packing unless both kk and nn are odd and GG is isomorphic to a single exceptional graph. The statement is presented as an application conjecture in the source; its resolution status is not given.

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.