A note on two orthogonal totally C4-free one-factorizations of complete graphs
Abstract
A pair of orthogonal one-factorizations F and G of the complete graph Kn is totally C4-free, if the union F G, for any F,G∈F, does not include a cycle of length four. In this note, we prove if q3 (mod 4) is a prime power with q≥11, then there is a pair of orthogonal totally C4-free one-factorizations of Kq+1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.