An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
From MaRDI portal
Publication:405301
zbMath1300.05014arXiv1402.0668MaRDI QIDQ405301
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.0668
Related Items (5)
A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ Unnamed Item ⋮ On \(r\)-cross \(t\)-intersecting families for weak compositions ⋮ A Deza-Frankl type theorem for set partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- Stability for \(t\)-intersecting families of permutations
- The complete intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- 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
- 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
- On cross-intersecting families of set partitions
- Shadows and intersections in vector spaces
- 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
- A generalization of the Erdős-Ko-Rado theorem on finite set systems
- Erdős-Ko-Rado theorems for uniform set-partition systems
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extremal t -intersecting sub-families of hereditary families
- Concavity properties and a generating function for stirling numbers
- Intersecting families of permutations
- An Erdős-Ko-Rado theorem for multisets
- Intersecting families of permutations
This page was built for publication: An Erdős-Ko-Rado theorem for permutations with fixed number of cycles