Vertex-disjoint K_1+(K_1 ∪ K_2) in K_(1,4)-free Graphs with Minimum Degree at Least Four

作     者：Yun Shu GAO Qing Song ZOU 

作者机构：School of Mathematics and Computer ScienceNingxia University Department of MathematicsXidian University 

出 版 物：《Acta Mathematica Sinica,English Series》 (数学学报（英文版）)

年 卷 期：2014年第30卷第4期

页      面：661-674页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by National Natural Science Foundation of China(Grant Nos.11161035 and 11226292) Ningxia Ziran(Grant No.NZ1153) research grant from Ningxia University(Grant No.zr1122) 

主　　题：Forbidden graphs Vertex-disjoint subgraphs Minimum degree 

摘      要：A graph is said to be K1,4-free if it does not contain an induced subgraph isomorphic to K1,4. Let κ be an integer with κ ≥ 2. We prove that if G is a K1,4-free graph of order at least llκ- 10 with minimum degree at least four, then G contains k vertex-disjoint copies of K1 ＋ （K1 ∪ KK2）.