【摘要】 设n和r是正整数使得r≥n+1≥4.一个图被称为K1,n-free图,如果它不含导出子图K1,n.证明了:若G是一个有圈H的图且r|V(G)|为偶数,G-E(H)是连通的K1,n-free图且G-E(H)的顶点最小度至少是n(r+1)-3r-2r n-22(n-1)-n-1r-2r n-22(n-1)2+n-3,那么G有r-因子F包含H中的所有的边.更多还原

【Abstract】 Let n and r be positive integers with r≥n+1≥4.A graph G is and G is a connected graph G is and Gis a connected graph with r｜V（G）｜even,G-E（H） is connected and K_1,n-free and the minimum degree of（G-E（H）） is at leastn（r+1）-3[]r-2r n-2[]2（n-1）-n-1[]r-2r n-2[]2（n-1）²+n-3,then G has an r-factor F such that E（H）E（F）.更多还原