This paper provides a new upper bound on the 2-dimension of partially ordered sets. The 2-dimension of an ordered set P is the smallest cardinality of a set S such that there exists an order-embedding of P into te boolean lattice 2S (all the subsets of S ordered by inclusion). The proof is non-constructive and uses a probabilistic argument. We link the resulrs and trhe proof with two known theorems of the theory of ordered sets.Ce papier présente une nouvelle borne supérieure sur la 2-dimension des ensembles ordonnées. La 2-dimension d'un ordre P est le cardinal minium d'un ensemble S tel qu'il existe un plongement d'ordre de P dans le treillis booléen S (composée de tous les sous-ensembles de S ordonnées par l'inclusion). La preuve est no...
AbstractLet B(j, k; n) be the ordered set obtained by ordering the j element and k element subsets o...
A family F of s-subsets of [t]is a (ϑ,s,t)-family iff the intersection of any two distinct elements ...
The main question asked when manipulating partial orders (hierarchies), is how to represent them in ...
This paper provides a new upper bound on the 2-dimension of partially ordered sets. The 2-dimension ...
Rapport interneThis paper provides a new upper bound on the 2-dimension of partially ordered sets. T...
(eng) This paper provides a new upper bound on the 2-dimension of partially ordered sets. The 2-dime...
International audienceA well-known method to represent a partially ordered set P (order for short) c...
International audienceA well-known method to represent a partially ordered set P (order for short) c...
AbstractThe dimension of a partially ordered set P is the smallest integer n (if it exists) such tha...
AbstractWe study the topic of the title in some detail. The main results are summarized in the first...
AbstractThe dimension of a partially ordered set P is the smallest integer n (if it exists) such tha...
AbstractIn this paper, we show that if a partially ordered set has 2n elements and has dimension n, ...
Abstract. We use a variety of combinatorial techniques to prove several theorems concerning fraction...
AbstractWe use a variety of combinatorial techniques to prove several theorems concerning fractional...
Dès qu’on manipule des ordres partiels (des hiérarchies), il est naturel de se demander comment les ...
AbstractLet B(j, k; n) be the ordered set obtained by ordering the j element and k element subsets o...
A family F of s-subsets of [t]is a (ϑ,s,t)-family iff the intersection of any two distinct elements ...
The main question asked when manipulating partial orders (hierarchies), is how to represent them in ...
This paper provides a new upper bound on the 2-dimension of partially ordered sets. The 2-dimension ...
Rapport interneThis paper provides a new upper bound on the 2-dimension of partially ordered sets. T...
(eng) This paper provides a new upper bound on the 2-dimension of partially ordered sets. The 2-dime...
International audienceA well-known method to represent a partially ordered set P (order for short) c...
International audienceA well-known method to represent a partially ordered set P (order for short) c...
AbstractThe dimension of a partially ordered set P is the smallest integer n (if it exists) such tha...
AbstractWe study the topic of the title in some detail. The main results are summarized in the first...
AbstractThe dimension of a partially ordered set P is the smallest integer n (if it exists) such tha...
AbstractIn this paper, we show that if a partially ordered set has 2n elements and has dimension n, ...
Abstract. We use a variety of combinatorial techniques to prove several theorems concerning fraction...
AbstractWe use a variety of combinatorial techniques to prove several theorems concerning fractional...
Dès qu’on manipule des ordres partiels (des hiérarchies), il est naturel de se demander comment les ...
AbstractLet B(j, k; n) be the ordered set obtained by ordering the j element and k element subsets o...
A family F of s-subsets of [t]is a (ϑ,s,t)-family iff the intersection of any two distinct elements ...
The main question asked when manipulating partial orders (hierarchies), is how to represent them in ...