Counting Partial Orders with a Fixed Number of Comparable Pairs

DOI10.1017/S0963548301004503zbMath0976.06001OpenAlexW2160416336MaRDI QIDQ2726711

Angelika Steger, Anusch Taraz, Hans Jürgen Prömel

Publication date: 18 July 2001

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548301004503

zbMATH Keywords

layer posetsnumber of partial orders with a fixed number of comparable pairs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Searching in random partially ordered sets ⋮ Phase transitions in the evolution of partial orders ⋮ Poset limits can be totally ordered