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/

Zendy Plus

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

Zendy Tools

Zendy Open

A fundamental result of K\"uhn and Osthus [The minimum degree threshold forperfect graph packings, Combinatorica, 2009] determines up to an additiveconstant the minimum degree threshold that forces a graph to contain a perfectH-tiling. We prove a degree sequence version of this result which allows for asignificant number of vertices to have lower degree.

A degree sequence version of the K\"uhn-Osthus tiling theorem