Degree Sum Condition for Vertex-Disjoint 5-Cycles

Abstract

Abstract Let n and k be two integers and G a graph with n = 5k vertices. Wang proved that if δ (G) ≥ 3k, then G contains k vertex disjoint cycles of length 5. In 2018, Chiba and Yamashita asked whether the degree condition can be replaced by degree sum condition. In this paper, we give a positive answer to this question.