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

In this paper we adapt techniques used by Ahlswede and Khachatrian in theirproof of the Complete Erd\H{o}s-Ko-Rado Theorem to show that if $n \geq 2t+1$,then any pairwise $t$-cycle-intersecting family of permutations has cardinalityless than or equal to $(n-t)!$. Furthermore, the only families attaining thissize are the stabilizers of $t$ points, that is, families consisting of allpermutations having $t$ 1-cycles in common. This is a strengthening of aprevious result of Ku and Renshaw and supports a recent conjecture by Ellis,Friedgut and Pilpel concerning the corresponding bound for $t$-intersectingfamilies of permutations.

The exact bound for the Erd\H{o}s-Ko-Rado theorem for $t$-cycle-intersecting permutations