This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least number of vertices. In this note, we show that (k; g)-cage has an r-factor of girth at least g containing or