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

A poset is (r + s)-free if it does not contain two incomparable chains ofsize r and s, respectively. We prove that when r and s are at least 2, theFirst-Fit algorithm partitions every (r + s)-free poset P into at most8(r-1)(s-1)w chains, where w is the width of P. This solves an open problem ofBosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010).

First-Fit is Linear on Posets Excluding Two Long Incomparable Chains