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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A family of perfect matchings of $K_{2n}$ is $intersecting$ if any two of itsmembers have an edge in common. It is known that if $\mathcal{F}$ is family ofintersecting perfect matchings of $K_{2n}$, then $|\mathcal{F}| \leq (2n-3)!!$and if equality holds, then $\mathcal{F} = \mathcal{F}_{ij}$ where $\mathcal{F}_{ij}$ is the family of all perfect matchings of $K_{2n}$ thatcontain some fixed edge $ij$. In this note, we show that the extremal familiesare stable, namely, that for any $\epsilon \in (0,1/\sqrt{e})$ and $n >n(\epsilon)$, any intersecting family of perfect matchings of size greater than$(1 - 1/\sqrt{e} + \epsilon)(2n-3)!!$ is contained in $\mathcal{F}_{ij}$ forsome edge $ij$. The proof uses the Gelfand pair $(S_{2n},S_2 \wr S_n)$ alongwith an isoperimetric method of Ellis.

Stability for Intersecting Families of Perfect Matchings