Counting partial orders with a fixed number of comparable pairs

DOI10.1017/S0963548301004503MaRDI QIDQ2726711zbMATH OpenOpenAlexFDO

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

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, http://edoc.hu-berlin.de/18452/28349

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)

Recommendations

• Linear extensions and comparable pairs in partial orders
• Phase transitions in the evolution of partial orders
• scientific article; zbMATH DE number 4016963
• scientific article; zbMATH DE number 1948237
• The number of partial orders of fixed width

Cited in

(8)

• On the number of orderings of \(n\) items
• Construction of Ferrero pairs of all possible orders
• scientific article; zbMATH DE number 4010574 (Why is no real title available?)
• scientific article; zbMATH DE number 1948237 (Why is no real title available?)
• Poset limits can be totally ordered
• Principles and Practice of Constraint Programming – CP 2004
• Phase transitions in the evolution of partial orders
• Searching in random partially ordered sets

This page was built for publication: Counting partial orders with a fixed number of comparable pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2726711)