Cycles in 2-Factorizations of Kₙ

Abstract

This work studies cycles in 2-factorizations of Kn (undirected complete graph with n vertices) and gives a complete solution (with three possible exceptions) of the problem of constructing 2-factorizations of Kn containing a specified number of 8-cycles, for both n even and odd.

Bu çalışmada n köşeli tam graflardaki döngüler problemi işlenmekte, tek ve çift köşeli tam graflardaki 8-döngü sayısı problemine (üç olası istisna ile) çözüm verilmektedir.