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 a fixed integer $\ell$ a path is long if its length is at least $\ell$.We prove that for all integers $k$ and $\ell$ there is a number $f(k,\ell)$such that for every graph $G$ and vertex sets $A,B$ the graph $G$ eithercontains $k$ edge-disjoint long $A$-$B$-paths or it contains an edge set $F$ ofsize $|F|\leq f(k,\ell)$ that meets every long $A$-$B$-path. This is the edgeanalogue of a theorem of Montejano and Neumann-Lara (1984). We also prove asimilar result for long $A$-paths and long $\mathcal{S}$-paths.

Long $A$-$B$-paths have the edge-Erd\H os-P\'osa property