Abstract We show that every graph on vertices with is spanned by a complete blow‐up of a cycle with clusters of nearly uniform size . The proof is based on a recently introduced approach for finding vertex‐spanning substructures via blow‐up covers.
Lang et al. (Thu,) studied this question.