A bijection between edges of the Turán graph and irreducible elements in the dominance order lattice

Abstract

In this paper we build a bijection between the meet-irreducible elements of the lattice of the compositions of $n$ with parts in $[1,p]$ equipped with the dominance order, and the edges of the $(n,p)$-Turán graph. Using this bijection, we then compute asymptotically the average value of some statistics on those meet-irreducible compositions.

11 pages, 2 figures, 2 tables