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/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

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

Zendy Tools

Zendy Open

For an $m$-cycle $C$, an inside $m$-cycle of $C$ is a cycle on the samevertex set, that is edge-disjoint from $C$. In an $m$-cycle system,$(\mathcal{X}, \mathcal{C})$, if inside $m$-cycles can be chosen -one for eachcycle- to form another $m$-cycle system, then $(\mathcal{X}, \mathcal{C})$ iscalled an almost $2$-perfect $m$-cycle system. Almost $2$-perfect cycle systemscan be considered as generalisations of $2$-perfect cycle systems. Cyclepackings are generalisations of cycle systems that allow to have leaves afterdecomposition. In this paper, we prove that an almost $2$-perfect maximumpacking of $K_n$ with $8$-cycles of order $n$ exists for each $n\geq 8$. Wealso construct a maximum $8$-cycle packing of order $n$ which is not almost$2$-perfect for each $n \geq 10$.

Almost 2-perfect 8-cycle systems