3 papers
math.CO2026
Matchings in permutations
Eduard Inozemtsev, Dmitrii Kolupaev, Andrey Kupavskii
We say that two permutations intersect if they map some element to the same element . A matching in a family of permutations is a collection of pairwise disjoin…
math.CO2026
Frankl's diversity theorem for permutations
Eduard Inozemtsev, Andrey Kupavskii
In 1987, Frankl proved an influential stability result for the Erd\H os--Ko--Rado theorem, which bounds the size of an intersecting family in terms of its distance from the nearest…
math.CO2024
Two questions on Kneser colorings
Eduard Inozemtsev, Andrey Kupavskii
In this paper, we investigate two questions on Kneser graphs . First, we prove that the union of intersecting families in has size at most ${n\choose…