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 Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For $0 \leq t \leq r$ let $m(t,r)$ be the maximum number $s$ such that every$t$-edge-connected $r$-graph has $s$ pairwise disjoint perfect matchings. Thereare only a few values of $m(t,r)$ known, for instance $m(3,3)=m(4,r)=1$, and$m(t,r) \leq r-2$ for all $t \not = 5$, and $m(t,r) \leq r-3$ if $r$ is even.We prove that $m(2l,r) \leq 3l - 6$ for every $l \geq 3$ and $r \geq 2 l$.

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs