AbstractLet P and Q be (partially) ordered sets with the same comparability graph. A bijection is constructed between the sets of linear extensions of P and Q such that the number of setups is preserved. This yields a common generalization of the comparability invariance of order dimension, setup number and number of linear extensions
Consider the linear extensions of a partial order. A setup occurs in a linear extension if two conse...
summary:A construction is given which makes it possible to find all linear extensions of a given ord...
AbstractAn α-balanced pair in a partially ordered set P = (X, <) is a pair (x, y) of elements of X s...
AbstractLetPbe a two-dimensional order, and __Pany complement ofP, i.e., any partial order whose com...
AbstractIn this paper, at first we describe a digraph representing all the weak-order extensions of ...
Article dans revue scientifique avec comité de lecture. internationale.International audienceIn this...
AbstractWe approximate the number of linear extensions of an ordered set by counting “critical” subo...
AbstractAn undirected graph G is called a comparability graph if there exists an orientation of its ...
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...
AbstractGiven a partial order P defined on a finite set X, a binary relation ≻P may be defined on X ...
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,≤...
AbstractGiven 2 ⩽ m ⩽ n, let P(m, n) be the family of partially ordered sets on {1, 2, …, n} in whic...
We answer the question, when a partial order in a partially ordered algebraic structure has a compat...
Consider the linear extensions of a partial order. A setup occurs in a linear extension if two conse...
summary:A construction is given which makes it possible to find all linear extensions of a given ord...
AbstractAn α-balanced pair in a partially ordered set P = (X, <) is a pair (x, y) of elements of X s...
AbstractLetPbe a two-dimensional order, and __Pany complement ofP, i.e., any partial order whose com...
AbstractIn this paper, at first we describe a digraph representing all the weak-order extensions of ...
Article dans revue scientifique avec comité de lecture. internationale.International audienceIn this...
AbstractWe approximate the number of linear extensions of an ordered set by counting “critical” subo...
AbstractAn undirected graph G is called a comparability graph if there exists an orientation of its ...
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...
AbstractGiven a partial order P defined on a finite set X, a binary relation ≻P may be defined on X ...
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,≤...
AbstractGiven 2 ⩽ m ⩽ n, let P(m, n) be the family of partially ordered sets on {1, 2, …, n} in whic...
We answer the question, when a partial order in a partially ordered algebraic structure has a compat...
Consider the linear extensions of a partial order. A setup occurs in a linear extension if two conse...
summary:A construction is given which makes it possible to find all linear extensions of a given ord...
AbstractAn α-balanced pair in a partially ordered set P = (X, <) is a pair (x, y) of elements of X s...