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

It is well-known that the number of non-crossing perfect matchings of $2k$points in convex position in the plane is $C_k$, the $k$th Catalan number.Garc\'ia, Noy, and Tejel proved in 2000 that for any set of $2k$ points ingeneral position, the number of such matchings is at least $C_k$. We show thatthe equality holds only for sets of points in convex position, and for oneexceptional configuration of $6$ points.

The number of non-crossing perfect plane matchings is minimized (almost) only by point sets in convex position