A note on two orthogonal totally $C_4$-free one-factorizations of complete graphs
Combinatorics
2020-07-20 v3
Abstract
A pair of orthogonal one-factorizations and of the complete graph is totally -free, if the union , for any , does not include a cycle of length four. In this note, we prove if (mod 4) is a prime power with , then there is a pair of orthogonal totally -free one-factorizations of .
Cite
@article{arxiv.1906.09291,
title = {A note on two orthogonal totally $C_4$-free one-factorizations of complete graphs},
author = {Adrián Vázquez-Ávila},
journal= {arXiv preprint arXiv:1906.09291},
year = {2020}
}