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











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)