## Abstract

A graph is said to be K_{1,n}‐free, if it contains no K_{1,n} as an induced subgraph. We prove that for n ⩾ 3 and r ⩾ n −1, if G is a K_{1,n}‐free graph with minimum degree at least (n^{2}/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).

Original language | English |
---|---|

Pages (from-to) | 337-344 |

Number of pages | 8 |

Journal | Journal of Graph Theory |

Volume | 15 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1991 |

## ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint

Dive into the research topics of 'Regular factors in K_{1,n}free graphs'. Together they form a unique fingerprint.