Erdős-Ko-Rado theorems on the weak Bruhat lattice

DOI10.1016/j.dam.2018.12.019zbMath1464.05344arXiv1904.01436OpenAlexW2910048822MaRDI QIDQ2026320

Vikram Kamat, Karen Meagher, Glenn H. Hurlbert, Susanna Fishel

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Ko-Rado theoremBruhat latticeintersecting permutations

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05)

Cites Work

• Improved bounds for Erdős' matching conjecture
• Product decompositions of the symmetric group induced by separable permutations
• A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• Compression and Erdős-Ko-Rado graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Intersection theorems for systems of finite sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Erdős-Ko-Rado theorems on the weak Bruhat lattice