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

H. Cao; L. Wang

REVIEW

Almost resolvable k-cycle systems with kequiv 2pmod 4

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.00647 v3 pith:MBK7OUB6 submitted 2017-09-25 math.CO

Almost resolvable k-cycle systems with kequiv 2pmod 4

L. Wang , H. Cao This is my paper

classification math.CO

keywords almostcycleequivpmodresolvablecombinexceptexists

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original 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).

Almost resolvable k-cycle systems with kequiv 2pmod 4

discussion (0)