TY - JOUR
T1 - Regular factors in K1,n free graphs
AU - Egawa, Yoshimi
AU - Ota, Katsuhiro
PY - 1991
Y1 - 1991
N2 - A graph is said to be K1,n‐free, if it contains no K1,n as an induced subgraph. We prove that for n ⩾ 3 and r ⩾ n −1, if G is a K1,n‐free graph with minimum degree at least (n2/4(n −1))r + (3n −6)/2 + (n −1)/4r, then G has an r‐factor (in the case where r is even, the condition r ⩾ n −1 can be dropped).
AB - A graph is said to be K1,n‐free, if it contains no K1,n as an induced subgraph. We prove that for n ⩾ 3 and r ⩾ n −1, if G is a K1,n‐free graph with minimum degree at least (n2/4(n −1))r + (3n −6)/2 + (n −1)/4r, then G has an r‐factor (in the case where r is even, the condition r ⩾ n −1 can be dropped).
UR - http://www.scopus.com/inward/record.url?scp=84987584143&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84987584143&partnerID=8YFLogxK
U2 - 10.1002/jgt.3190150310
DO - 10.1002/jgt.3190150310
M3 - Article
AN - SCOPUS:84987584143
SN - 0364-9024
VL - 15
SP - 337
EP - 344
JO - Journal of Graph Theory
JF - Journal of Graph Theory
IS - 3
ER -