On the maximum number of permutations with given maximal or minimal distance

1977/05/01 by Péter Frankl, Peter Frankl, Mikhail Deza · 3 citations
Computer Science · Engineering · Mathematics · #Bayesian Methods and Mixture Models #Combinatorics #Conjecture #Limits and Structures in Graph Theory #Mathematics #Physics #graph theory and CDMA systems

paper · doi:10.1016/0097-3165(77)90009-7

crossref issued 1977/05/01 · crossref published 1977/05/01 · crossref published-print 1977/05/01 · openalex publication_date 1977/05/01 · crossref created 2005/02/09 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/04/30 · openalex updated_date 2026/07/23

Citations

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Cited by

• A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations
• Stable sets of maximal size in Kneser-type graphs
• Erdős–Ko–Rado theorem [wikipedia]