Intersection theorem for finite permutations

DOI10.1134/S0032946011010042zbMath1236.05003OpenAlexW2077893658WikidataQ105584104 ScholiaQ105584104MaRDI QIDQ764250

Vladimir Blinovsky

Publication date: 13 March 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946011010042

zbMATH Keywords

maximal number of permutationsset of cycles

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (1)

Remark on one problem in extremal combinatorics

Cites Work

• The complete intersection theorem for systems of finite sets
• Lectures on advances in combinatorics
• Erdős-Ko-Rado theorems for permutations and set partitions
• The diametric theorem in Hamming spaces---optimal anticodes
• Stable sets of maximal size in Kneser-type graphs
• Intersecting families of permutations
• The Erdős-Ko-Rado theorem for integer sequences

This page was built for publication: Intersection theorem for finite permutations