An Erdős-Ko-Rado-type theorem in Coxeter groups

Authors:
Jun Wang;Sophia J. Zhang
Affiliations:
Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China;Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China
Venue:
European Journal of Combinatorics
Year:
2008

Citing 2
Cited 5

Intersecting families of permutations

European Journal of Combinatorics
Stable sets of maximal size in Kneser-type graphs

European Journal of Combinatorics

Eigenvalues of the derangement graph

Journal of Combinatorial Theory Series A
Some Erdős-Ko-Rado theorems for injections

European Journal of Combinatorics
Cross-intersecting families and primitivity of symmetric systems

Journal of Combinatorial Theory Series A
Setwise intersecting families of permutations

Journal of Combinatorial Theory Series A
Nontrivial independent sets of bipartite graphs and cross-intersecting families

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

An Erdos-Ko-Rado-type theorem for the symmetric group S"n says that a maximal-sized intersecting set in S"n is a coset of a stabilizer of one point. In this note we present a short proof of this result, and establish an analogous theorem for Coxeter groups of types B and D.