Largest s-matching-free families of permutations are characterized, with a Hilton-Milner type theorem and results for derangements.
Kupavskii, Erd˝ os–Ko–Rado type results for partitions via spread approximations, European J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Matchings in permutations
Largest s-matching-free families of permutations are characterized, with a Hilton-Milner type theorem and results for derangements.