arXiv Analytics

Sign in

arXiv:1710.00647 [math.CO]AbstractReferencesReviewsResources

Constructions of almost resolvable $k$-cycle systems of order $2k+1$ with $k\equiv 2\pmod 4$

L. Wang, H. Cao

Published 2017-09-25Version 1

In this paper, we almost completely solve the existence of almost resolvable $k$-cycle systems of order $2kt+1$ for any $k \equiv 2 \pmod 4$. Thus we have partially solved an open problem given by Lindner, Meszka, and Rosa.

Comments: cycle system; almost resolvable cycle system. arXiv admin note: substantial text overlap with arXiv:1706.05958
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2206.09695 [math.CO] (Published 2022-06-20)
Almost resolvable even cycle systems of $(K_u \times K_g)(λ)$
arXiv:2212.11058 [math.CO] (Published 2022-12-21)
Spectrum of $3$-uniform $6$- and $9$-cycle systems over $K_v^{(3)}-I$
arXiv:0806.4208 [math.CO] (Published 2008-06-25)
More Constructions for Turán's (3, 4)-Conjecture

Links

Toolbox