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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Joret, Micek, Milans, Trotter, Walczak, and Wang recently asked if thereexists a constant $d$ such that if $P$ is a poset with cover graph of $P$ ofpathwidth at most $2$, then $\dim(P)\leq d$. We answer this question in theaffirmative by showing that $d=17$ is sufficient. We also show that if $P$ is aposet containing the standard example $S_5$ as a subposet, then the cover graphof $P$ has treewidth at least $3$.

Posets with cover graph of pathwidth two have bounded dimension