{"paper":{"title":"Almost resolvable $k$-cycle systems with $k\\equiv 2\\pmod 4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H. Cao, L. Wang","submitted_at":"2017-09-25T00:36:19Z","abstract_excerpt":"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)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00647","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}