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

Consider the complete convex geometric graph on  vertices,  , i.e., the set of all boundary edges and diagonals of a planar convex -gon . In (Keller and Perles, Israel J Math 187:465–484, ), the smallest sets of edges that meet all the simple perfect matchings (SPMs) in   (called “blockers”) are characterized, and it is shown that all these sets are caterpillar graphs with a special structure, and that their total number is . In this paper we characterize the co-blockers for SPMs in  , that is, the smallest sets of edges that meet all the blockers. We show that the co-blockers are exactly those perfect matchings  in   where all edges are of odd order, and two edges of  that emanate from two adjacent vertices of  never cross. In particular, while the number of SPMs and the number of blockers grow exponentially with , the number of co-blockers grows super-exponentially.

Characterization of Co-blockers for Simple Perfect Matchings in a Convex Geometric Graph