English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $K_v^*$ denote the complete graph $K_v$ if $v$ is odd and $K_v-I$, thecomplete graph with the edges of a 1-factor removed, if $v$ is even. Givennon-negative integers $v, M, N, \alpha, \beta$, the Hamilton-Waterloo problemasks for a $2$-factorization of $K^*_v$ into $\alpha$ $C_M$-factors and $\beta$$C_N$-factors. Clearly, $M,N\geq 3$, $M\mid v$, $N\mid v$ and $\alpha+\beta =\lfloor\frac{v-1}{2}\rfloor$ are necessary conditions.  Very little is known on the case where $M$ and $N$ have different parities.In this paper, we make some progress on this case by showing, among otherthings, that the above necessary conditions are sufficient whenever $M|N$,$v>6N>36M$, and $\beta\geq 3$.

On the Hamilton-Waterloo Problem with cycle lengths of distinct parities