## Abstract

A graph is called K_{1}, _{n}-free if it contains no K_{1}, _{n} as an induced subgraph. Let n(≥ 3), r be integers (if r is odd, r ≥ n - 1). We prove that every K_{1}, _{n}-free connected graph G with r|V(G)| even has an r-factor if its minimum degree is at least (n + n-1/r) ⌈n/2(n - 1) r⌉ - n - 1/r (⌈n/2(n - 1) r⌉)^{2} + n - 3. This degree condition is sharp.

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

Pages (from-to) | 59-64 |

Number of pages | 6 |

Journal | Journal of Graph Theory |

Volume | 22 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1996 May |

## ASJC Scopus subject areas

- Geometry and Topology

## Fingerprint

Dive into the research topics of 'A Degree Condition for the Existence of Regular Factors in K_{1},

_{n}-Free Graphs'. Together they form a unique fingerprint.