A short proof of a theorem of Kano and Yu on factors in regular graphs (Q2372895)

Summary: In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by \textit{M. Kano} and \textit{Q. Yu} [Electron. J. Comb. 12, No.~1, Research paper N23, 6~p., electronic only (2005; Zbl 1079.05075)]. Let \(e\) be an edge of an \(r\)-regular graph \(G\). If \(G\) has a 1-factor containing \(e\) and a 1-factor avoiding \(e\), then \(G\) has a \(k\)-factor containing \(e\) and a \(k\)-factor avoiding \(e\) for every \(k\in\{1,2,\dots,r-1\}\).