A note on two orthogonal totally C4C_4-free one-factorizations of complete graphs

preprint2020arXivOpen access

Abstract

A pair of orthogonal one-factorizations F\mathcal{F} and G\mathcal{G} of the complete graph KnK_n is totally C4C_4-free, if the union F∪GF\cup G, for any F,G∈F∪GF,G\in\mathcal{F}\cup\mathcal{G}, does not include a cycle of length four. In this note, we prove if q≡3q\equiv3 (mod 4) is a prime power with q≥11q\geq11, then there is a pair of orthogonal totally C4C_4-free one-factorizations of Kq+1K_{q+1}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.