REVIEW
The Hamilton-Waterloo problem on wreath product graph $C_m \wr K_{16}$
Not yet reviewed by Pith; the record is open.
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
Signed reviews
abstract
The Hamilton-Waterloo problem is a problem of graph factorization. The Hamilton-Waterloo problem HWP$(H;m,n;\alpha,\beta)$ asks for a $2$-factorization of $H$ containing $\alpha$ $C_m$-factors and $\beta$ $C_n$-factors. In this paper, we almost completely solve the Hamilton-Waterloo problem on wreath product graph $C_m \wr K_{16}$ with $C_{16}$-factors and $C_m$-factors for an odd integer $m$.
Discussion (0). Continue with ORCID to comment.