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

We characterize the class of infinite connected graphs $ G $ for which thereexists a $ T $-join for any choice of an infinite $ T \subseteq V(G) $. We alsoshow that the following well-known fact remains true in the infinite case. If $G $ is connected and does not contain a $ T $-join, then it will if we eitherremove an arbitrary vertex from $ T $ or add any new vertex to $ T $.

T-joins in infinite graphs as edge-disjoint system of paths matching the vertices in $ T $