Intersection theorem for finite permutations

DOI10.1134/S0032946011010042MaRDI QIDQ764250zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Cites work

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

Cited in

(3)

• Remark on one problem in extremal combinatorics
• Intersecting generalised permutations
• Fine and Wilf's theorem for permutations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764250)