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 for these meet-irreducible compositions.
Fields of Study & Subjects
Advanced Combinatorial Mathematics
Finite Group Theory Research
Advanced Mathematical Identities
Publication details
- Journal / source
- Discrete Mathematics Letters
- Volume
- 18
- Publication date
- 26 August 2026
- Language
- EN