Kleitman and Rothschild (Trans. Amer. Math. Soc. 205 (1975), 205–220) gave an asymptotic formula for the number of partial orders with ground-set [n]. We give a shorter proof of their result and extend it to count the number of pairs (P, ≺), where P is a partial order on [n] and ≺ is a linear extension of P. This gives us an asymptotic formula for (a) the average number of linear extensions of an n-element partial order and (b) the number of suborders of an n-element linear order
AbstractIt is well known that the linear extension majority relation of a partially ordered set (P,≤...
AbstractLet (X, P) denote a poset for which P is an asymmetric partial order on a finete set X of ca...
AbstractWe determine the approximate number of partial orders with a fixed number of comparable pair...
Kleitman and Rothschild (Trans. Amer. Math. Soc. 205 (1975), 205–220) gave an asymptotic formula for...
AbstractWe approximate the number of linear extensions of an ordered set by counting “critical” subo...
AbstractLetPbe a two-dimensional order, and __Pany complement ofP, i.e., any partial order whose com...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
AbstractA popular model of random orders is obtained by taking two disjoint n-element antichains A1 ...
AbstractGiven a partial order P defined on a finite set X, a binary relation ≻P may be defined on X ...
AbstractLet (X, P) denote a poset for which P is an asymmetric partial order on a finete set X of ca...
AbstractLetPbe a two-dimensional order, and __Pany complement ofP, i.e., any partial order whose com...
AbstractWe find asymptotic upper and lower bounds on the number of linear extensions of the containm...
Let P be a two-dimensional order, and P̄ any complement of P, i.e., any partial order whose comparab...
AbstractIt is well known that the linear extension majority relation of a partially ordered set (P,≤...
AbstractLet (X, P) denote a poset for which P is an asymmetric partial order on a finete set X of ca...
AbstractWe determine the approximate number of partial orders with a fixed number of comparable pair...
Kleitman and Rothschild (Trans. Amer. Math. Soc. 205 (1975), 205–220) gave an asymptotic formula for...
AbstractWe approximate the number of linear extensions of an ordered set by counting “critical” subo...
AbstractLetPbe a two-dimensional order, and __Pany complement ofP, i.e., any partial order whose com...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
We study the number of linear extensions of a partial order with a given proportion of comparable pa...
AbstractA popular model of random orders is obtained by taking two disjoint n-element antichains A1 ...
AbstractGiven a partial order P defined on a finite set X, a binary relation ≻P may be defined on X ...
AbstractLet (X, P) denote a poset for which P is an asymmetric partial order on a finete set X of ca...
AbstractLetPbe a two-dimensional order, and __Pany complement ofP, i.e., any partial order whose com...
AbstractWe find asymptotic upper and lower bounds on the number of linear extensions of the containm...
Let P be a two-dimensional order, and P̄ any complement of P, i.e., any partial order whose comparab...
AbstractIt is well known that the linear extension majority relation of a partially ordered set (P,≤...
AbstractLet (X, P) denote a poset for which P is an asymmetric partial order on a finete set X of ca...
AbstractWe determine the approximate number of partial orders with a fixed number of comparable pair...