Tag Archives: Erdos-Ko-Rado theorem

Extremal Combinatorics on Permutations

We talked about extremal problems for set systems: collections of subsets of an element sets, – Sperner’s theorem, the Erdos-Ko-Rado theorem, and quite a few more. (See here, here and here.) What happens when we consider collections of permutations rather than … Continue reading

Posted in Combinatorics | Tagged , , , , , | 9 Comments