For integers $n>k\ge1$ with $nk$ even, let $m(n,k)$ be the maximum size of a graph of order $n$ with a unique $k$-factor. In 1964, Hetyei and in 1984, Hendry [\emph{J. Combin. Theory Ser. B} \textbf{37} (1984), 53--63] proved $m(n,1)=n^2/4$ for even $n$ and $m(n,2)=\lfloor n(n+1)/4\rfloor$, respectively. In 2000, Johan...
Zi-Xuan Yang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.