Regular factors in K1,n free graphs

Yoshimi Egawa, Katsuhiro Ota

Research output: Contribution to journalArticlepeer-review

32 Citations (Scopus)


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).

Original languageEnglish
Pages (from-to)337-344
Number of pages8
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - 1991

ASJC Scopus subject areas

  • Geometry and Topology


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

Cite this