Title
Counting Partial Orders with a Fixed Number of Comparable Pairs
Abstract
In 1978, Dhar suggested a model of a lattice gas whose states are partial orders. In this context he raised the question of determining the number of partial orders with a fixed number of comparable pairs. Dhar conjectured that in order to find a good approximation to this number, it should suffice to enumerate families of layer posets. In this paper we prove this conjecture and thereby prepare the ground for a complete answer to the question.
Year
DOI
Venue
2001
10.1017/S0963548301004503
Combinatorics, Probability & Computing
Keywords
Field
DocType
lattice gas,complete answer,comparable pairs,comparable pair,partial orders,fixed number,partial order,layer posets,good approximation
Discrete mathematics,Combinatorics,Lattice (order),Conjecture,Mathematics
Journal
Volume
Issue
ISSN
10
2
0963-5483
Citations 
PageRank 
References 
3
2.83
1
Authors
3
Name
Order
Citations
PageRank
Hans Jürgen Prömel143195.11
Angelika Steger2995111.50
Anusch Taraz316837.71