## Abstract

For a permutation π in the symmetric group Sn let
the total degree be its valency in the Hasse diagram of the strong Bruhat order on Sn, and let the down degree be the number of permutations which are covered by π in the strong Bruhat order. The maxima of the total degree and the down degree and their values at a random permutation are computed. Proofs involve variants of a classical theorem of Tur´an from extremal graph theory.

Original language | American English |
---|---|

Pages (from-to) | 14-14 |

Journal | Seminaire Lotharingien de Combinatoire |

Volume | 53 |

State | Published - 2004 |