Department of Mathematics2024-11-0920021302-3160N/AN/Ahttps://hdl.handle.net/20.500.14288/14507This work studies cycles in 2-faetorizations of K n (undireeted complete graph with n vertices) and gives a complete solution (with three possible exceptions) of the problem of constructing 2-factorizations of K n 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.MathematicsMatematikJournal Article2146-02055025