Further results on the Hamilton-Waterloo problem

H. Cao; L. Wang; S. Lu

REVIEW

Further results on the Hamilton-Waterloo problem

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 1605.00818 v1 pith:BYLOEJZ2 submitted 2016-05-03 math.CO

Further results on the Hamilton-Waterloo problem

L. Wang , S. Lu , H. Cao This is my paper

classification math.CO

keywords almostcyclehamilton-waterlooproblemresolvablecombinatorialcompletelyexistence

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

0 comments

read the original abstract

In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the Hamilton-Waterloo problem.

Further results on the Hamilton-Waterloo problem

discussion (0)