Almost resolvable $k$-cycle systems with $k\equiv 2\pmod 4$

L. Wang; H. Cao

Almost resolvable $k$-cycle systems with $k\equiv 2\pmod 4$

Combinatorics 2018-04-30 v3

Authors: L. Wang , H. Cao

Abstract

In this paper, we show that if $k\geq 6$ and $k \equiv 2 \pmod 4$ , then there exists an almost resolvable $k$ -cycle system of order $2kt+1$ for all $t\ge 1$ except possibly for $t=2$ and $k\geq 14$ . Thus we give a partial solution to an open problem posed by Lindner, Meszka, and Rosa (J. Combin. Des., vol. 17, pp.404-410, 2009).

Cite

@article{arxiv.1710.00647,
  title  = {Almost resolvable $k$-cycle systems with $k\equiv 2\pmod 4$},
  author = {L. Wang and H. Cao},
  journal= {arXiv preprint arXiv:1710.00647},
  year   = {2018}
}

Comments

cycle system; almost resolvable cycle system. arXiv admin note: substantial text overlap with arXiv:1706.05958, arXiv:1605.00818

Related papers

View all related →