The existence of cyclic (v,4,1)-designs
Combinatorics
2022-07-05 v2
Abstract
Even though Peltesohn proved that a cyclic (v,3,1)-design exists if and only if as early as 1939, the problem of determining the spectrum of cyclic (v,k,1)-designs with k>3 is far from being settled, even for k=4. This paper shows that a cyclic (v,4,1)-design exists if and only if and .
Keywords
Cite
@article{arxiv.2206.06751,
title = {The existence of cyclic (v,4,1)-designs},
author = {Menglong Zhang and Tao Feng and Xiaomiao Wang},
journal= {arXiv preprint arXiv:2206.06751},
year = {2022}
}