A non-trivial intersection theorem for permutations with fixed number of cycles

DOI10.1016/j.disc.2015.09.032zbMath1327.05006OpenAlexW2194589919MaRDI QIDQ898122

Publication date: 8 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.09.032

zbMATH Keywords

permutations Erdős-Ko-Rado \(t\)-intersecting family Frankl-Hilton-Milner

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Related Items (2)

Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ Unnamed Item

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
An analogue of the Erdős-Ko-Rado theorem for weak compositions
An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
A product version of the Erdős-Ko-Rado theorem
Stability for \(t\)-intersecting families of permutations
Cross-intersecting families and primitivity of symmetric systems
The complete intersection theorem for systems of finite sets
The exact bound in the Erdős-Ko-Rado theorem
The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
An Erdős--Ko--Rado theorem for partial permutations
Erdős-Ko-Rado-type theorems for colored sets
Intersecting families in the alternating group and direct product of symmetric groups
An Erdős-Ko-Rado-type theorem in Coxeter groups.
Shadows and intersections: Stability and new proofs
Erdős-Ko-Rado theorems for permutations and set partitions
Some Erdős-Ko-Rado theorems for injections
A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
On \(t\)-intersecting families of signed sets and permutations
The Erdős-Ko-Rado properties of various graphs containing singletons
Non-trivial intersecting families
The Erdős-Ko-Rado theorem for vector spaces
An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
On the maximum number of permutations with given maximal or minimal distance
The diametric theorem in Hamming spaces---optimal anticodes
Compression and Erdős-Ko-Rado graphs
Graphs with the Erdős-Ko-Rado property
Stable sets of maximal size in Kneser-type graphs
The complete nontrivial-intersection theorem for systems of finite sets
On cross-intersecting families of set partitions
Shadows and intersections in vector spaces
On \(r\)-cross \(t\)-intersecting families for weak compositions
An analogue of the Hilton-Milner theorem for set partitions
Erdős-Ko-Rado theorems for chordal graphs and trees
Erdős-Ko-Rado theorems for simplicial complexes
On cross-intersecting families of sets
On r-Cross Intersecting Families of Sets
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Extremal t -intersecting sub-families of hereditary families
AN ANALOGUE OF THE HILTON-MILNER THEOREM FOR WEAK COMPOSITIONS
SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Intersecting families of permutations
On intersecting families of finite sets
Intersecting families of permutations
A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: A non-trivial intersection theorem for permutations with fixed number of cycles