Meszka, Mariusz \(k\)-cycle free one-factorizations of complete graphs. (English) Zbl 1178.05077 Electron. J. Comb. 16, No. 1, Research Paper R3, 14 p. (2009). Summary: It is proved that for every \(n\geq 3\) and every even \(k\geq 4\), where \(k\neq 2n\), there exists one-factorization of the complete graph \(K_{2n}\) such that any two one-factors do not induce a graph with a cycle of length \(k\) as a component. Moreover, some infinite classes of one-factorizations, in which lengths of cycles induced by any two one-factors satisfy a given lower bound, are constructed. Cited in 7 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:one-factorization; complete graph PDFBibTeX XMLCite \textit{M. Meszka}, Electron. J. Comb. 16, No. 1, Research Paper R3, 14 p. (2009; Zbl 1178.05077) Full Text: EuDML EMIS