\(k\)-cycle free one-factorizations of complete graphs
type: Item
instance of: scholarly article
title: \(k\)-cycle free one-factorizations of complete graphs
zbMATH Open document ID: 1178.05077
author: Mariusz Meszka
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/117289
full work available at URL: v16i1r3.html
review text: 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.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5541068
zbMATH Keywords: one-factorization
zbMATH Keywords: complete graph
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5541068