go-v.orgdoi

$k$-Cycle Free One-Factorizations of Complete Graphs

Mariusz Meszka · The Electronic Journal of Combinatorics · 2009

  • DOI 10.37236/92
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2009

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2009

Abstract

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.

Open the resolved locator · 10.37236/92

Metadata licence: OpenAlex metadata (CC0)