Intersection theorem for finite permutations

Authors:
V. M. Blinovsky
Affiliations:
Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2011

Citing 5
Cited 1

The complete intersection theorem for systems of finite sets

European Journal of Combinatorics
Regular Article: The Diametric Theorem in Hamming Spaces驴Optimal Anticodes

Advances in Applied Mathematics
Intersecting families of permutations

European Journal of Combinatorics
Stable sets of maximal size in Kneser-type graphs

European Journal of Combinatorics
Erdős--Ko--Rado theorems for permutations and set partitions

Journal of Combinatorial Theory Series A

Remark on one problem in extremal combinatorics

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

We find the maximal number of permutations on a set of n elements such that any pair of permutations has at least t common cycles.