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

An $r$-graph is an $r$-regular graph where every odd set of vertices isconnected by at least $r$ edges to the rest of the graph. Seymour conjecturedthat any $r$-graph is $r+1$-edge-colorable, and also that any $r$-graphcontains $2r$ perfect matchings such that each edge belongs to two of them. Weshow that the minimum counter-example to either of these conjectures is abrick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud.

Bricks and conjectures of Berge, Fulkerson and Seymour