Abstract
In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the -factor and -factor for any graph is obtained.
Disclosure statement
No potential conflict of interest was reported by the author(s).