Setwise intersecting families of permutations

DOI10.1016/j.jcta.2011.12.003zbMath1237.05210arXiv1106.0725OpenAlexW2159609825MaRDI QIDQ765866

David Ellis

Publication date: 22 March 2012

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

Full work available at URL: https://arxiv.org/abs/1106.0725

zbMATH Keywords

representation theoryErdős-Ko-Radointersecting families of permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)

Related Items

An Erdős-Ko-Rado theorem for finite 2-transitive groups ⋮ Eigenvalues of Cayley graphs ⋮ Some Erdös-Ko-Rado results for linear and affine groups of degree two ⋮ Approximation by juntas in the symmetric group, and forbidden intersection problems ⋮ An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings ⋮ Intersection theorems for finite general linear groups ⋮ An extension of the Erdős-Ko-Rado theorem to uniform set partitions ⋮ On the intersection density of the symmetric group acting on uniform subsets of small size ⋮ On the intersection density of the Kneser graph \(K(n, 3)\) ⋮ Theorems of Erdős-Ko-Rado type in geometrical settings ⋮ Setwise intersecting families in classical Coxeter groups ⋮ Intersecting families in classical Coxeter groups ⋮ The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations ⋮ Intersecting families of discrete structures are typically trivial ⋮ Interlocked Permutations ⋮ 3-setwise intersecting families of the symmetric group ⋮ On the intersection density of primitive groups of degree a product of two odd primes ⋮ Path Separation by Short Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of generalized derangement graphs
• An Erdős-Ko-Rado-type theorem in Coxeter groups.
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• On the spectrum of the derangement graph
• On the maximum number of permutations with given maximal or minimal distance
• Stable sets of maximal size in Kneser-type graphs
• The Hook Graphs of the Symmetric Group
• Intersecting families of permutations
• Intersecting families of permutations