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 prove that, in several settings, a graph has exponentially manynowhere-zero flows. These results may be seen as a counting alternative to thewell-known proofs of existence of $Z_3$-, $Z_4$-, and $Z_6$-flows.  In the dual setting, proving exponential number of 3-colorings of planartriangle-free graphs is a related open question due to Thomassen. As a part ofthe proof we obtain a new splitting lemma for 6-edge-connected graphs, that maybe of independent interest.

Exponentially many nowhere-zero $Z_3$-, $Z_4$-, and $Z_6$-flows