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

MaRDI QIDQ2372895zbMATH OpenFDO

Authors Lutz Volkmann

Publication date 16 July 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/127894, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1n10.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

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\}\).

Recommendations

• Pan-factorial property in regular graphs
• \(\{k,r-k\}\)-factors of \(r\)-regular graphs
• Regular factors in regular graphs
• \(k\) -factors in regular graphs
• \(k\)-factors containing and avoiding specified sets of edges

Cited in

(2)

• Pan-factorial property in regular graphs
• scientific article; zbMATH DE number 29671 (Why is no real title available?)

This page was built for publication: A short proof of a theorem of Kano and Yu on factors in regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372895)