✦ LIBER ✦

A degree condition for the existence of regular factors inK1,n-free graphs

✍ Scribed by Ota, Katsuhiro; Tokuda, Taro

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 260 KB
Volume: 22
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199605)22:1<59::aid-jgt8>3.0.co;2-k

No coin nor oath required. For personal study only.

✦ Synopsis

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.