Balogh, Kostochka and Treglown's conjecture on degree sequences forcing perfect clique tilings
Statement
Let with dividing . Suppose that is a graph on vertices with degree sequence satisfying the following conditions:
Balogh, Kostochka and Treglown's conjecture. Then contains a perfect -tiling, that is, a collection of vertex-disjoint copies of covering all vertices of .
This conjecture seeks a degree-sequence condition forcing a perfect -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.