scientific article; zbMATH DE number 4118407
From MaRDI portal
Publication:4732492
[For the entire collection see Zbl 0667.00004.] A perfect 1-factorization of a graph is a partition of its edge set into 1-factors, with the property that the union of any two 1-factors is a Hamilton circuit. Perfect 1-factorizations of \(K_{2n}\) are known to exist when either n or 2n-1 are prime, or for a few isolated other values of n. This paper solves the smallest unknown case \(2n=40\). The smallest unknown case is now \(2n=52\).
Recommendations
- scientific article; zbMATH DE number 3985262
- A perfect one-factorization for \(K_{36}\)
- A perfect one-factorization of \(K_{36}\)
- scientific article; zbMATH DE number 4070947
- A perfect one-factorization ofK52
- A perfect one-factorisation of \(K_{56}\)
- Perfect one-factorizations of \(K_{1332}\) and \(K_{6860}\)
- Perfect 1-factorisations of \(K_{16}\)
- scientific article; zbMATH DE number 4066947
- On the perfect one-factorization conjecture
Cited in
(17)- A perfect one-factorization for \(K_{36}\)
- Perfect one-factorizations of \(K_{1332}\) and \(K_{6860}\)
- On the perfect one-factorization conjecture
- Sequentially perfect and uniform one-factorizations of the complete graph
- On the perfect 1-factorisation problem for circulant graphs of degree 4
- Perfect 1-Factorizations of a Family of Cayley Graphs
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- A perfect one-factorization ofK52
- scientific article; zbMATH DE number 4070947 (Why is no real title available?)
- Some new perfect one-factorizations from starters in finite fields
- scientific article; zbMATH DE number 54787 (Why is no real title available?)
- scientific article; zbMATH DE number 1228802 (Why is no real title available?)
- A perfect one-factorisation of \(K_{56}\)
- On semi-perfect 1-factorizations
- A perfect one-factorization of \(K_{36}\)
- One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane
- On perfect one-factorization of the complete graph \(K_{2p}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732492)