Erdős-Ko-Rado theorems for permutations and set partitions

DOI10.1016/j.jcta.2007.12.004zbMath1154.05056OpenAlexW2022917003WikidataQ105583643 ScholiaQ105583643MaRDI QIDQ941314

David Renshaw, Cheng Yeaw Ku

Publication date: 4 September 2008

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2007.12.004

zbMATH Keywords

permutationsset partitionsintersecting familiest-cycle-intersectingt-intersectin

Mathematics Subject Classification ID

Partitions of sets (05A18) Extremal set theory (05D05)

Related Items (19)

The maximum product of sizes of cross-intersecting families ⋮ Extremal \(t\)-intersecting families for direct products ⋮ On Chvàtal's conjecture and a conjecture on families of signed sets ⋮ Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Restricted intersecting families on simplicial complex ⋮ All 2-transitive groups have the EKR-module property ⋮ The Hilton-Milner theorem for attenuated spaces ⋮ Unnamed Item ⋮ Strongly intersecting integer partitions ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ Intersection theorem for finite permutations ⋮ 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
• The exact bound in the Erdős-Ko-Rado theorem
• On the maximum number of permutations with given maximal or minimal distance
• Contributions to the geometry of Hamming spaces
• Stable sets of maximal size in Kneser-type graphs
• Erdős-Ko-Rado theorems for uniform set-partition systems
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Combinatorial Optimization Problems for Systems of Subsets
• Probabilities for Intersecting Systems and Random Subsets of Finite Sets
• Intersecting families of permutations

This page was built for publication: Erdős-Ko-Rado theorems for permutations and set partitions