Luyining Gan

A Parameterized Algorithm for \({K_r}\)-Factors in Graphs of High Minimum Degree

Abstract. A [Formula: see text]-factor of a graph [Formula: see text] is a collection of vertex-disjoint [Formula: see text]-cliques covering [Formula: see text]. We prove the following algorithmic version of the classical Hajnal–Szemerédi theorem in graph theory, when [Formula:...