We show that every connected Kl,sfree graph with minimum degree at least 2k contains a k-factor and construct connected K1,3-free graphs with minimum degree k + O(dk) that have no k-factor.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.