Setwise intersecting families in classical Coxeter groups
From MaRDI portal
Publication:1727798
DOI10.1016/j.disc.2018.12.014zbMath1405.05191OpenAlexW2913772095WikidataQ128585796 ScholiaQ128585796MaRDI QIDQ1727798
Publication date: 20 February 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.12.014
Combinatorial aspects of representation theory (05E10) Reflection and Coxeter groups (group-theoretic aspects) (20F55)
Cites Work
- Unnamed Item
- Setwise intersecting families of permutations
- 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 finite imprimitive unitary reflection groups
- On the maximum number of permutations with given maximal or minimal distance
- Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups
- Stable sets of maximal size in Kneser-type graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Seminormal Representations of Weyl Groups and Iwahori-Hecke Algebras
- Intersecting families in classical Coxeter groups
- Intersecting families of permutations
- Intersecting families of permutations
This page was built for publication: Setwise intersecting families in classical Coxeter groups