AbstractWe consider the poset of all posets on n elements where the partial order is that of inclusion of comparabilities. We discuss some properties of this poset concerning its height, width, jump number and dimension. We also give algorithms to construct some maximal chains in this poset which have special properties for these parameters
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
AbstractOnline chain partitioning problem of posets is open for at least last 15 years. The best kno...
AbstractIn this journal, Leclerc proved that the dimension of the partially ordered set consisting o...
AbstractWe consider the poset of all posets on n elements where the partial order is that of inclusi...
Abstract. We consider the poset of all posets on n elements where the partial order is that of inclu...
AbstractLet A = [aij] be an m-by-n matrix. There is a natural way to associate a poset PA with A. Le...
AbstractThis paper is a continuation of another author's work (Order 1 (1985) 7–19), where arc diagr...
AbstractTwo new types of greedy chains, strongly and semi-strongly greedy, in posets are defined and...
AbstractTwo new types of greedy chains, strongly and semi-strongly greedy, in posets are defined and...
For a class of posets we establish that the f-vector of the chain polytope dominates the f-vector of...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
One question relating to partially ordered sets (posets) is that of partitioning or dividing the pos...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
AbstractOnline chain partitioning problem of posets is open for at least last 15 years. The best kno...
AbstractIn this journal, Leclerc proved that the dimension of the partially ordered set consisting o...
AbstractWe consider the poset of all posets on n elements where the partial order is that of inclusi...
Abstract. We consider the poset of all posets on n elements where the partial order is that of inclu...
AbstractLet A = [aij] be an m-by-n matrix. There is a natural way to associate a poset PA with A. Le...
AbstractThis paper is a continuation of another author's work (Order 1 (1985) 7–19), where arc diagr...
AbstractTwo new types of greedy chains, strongly and semi-strongly greedy, in posets are defined and...
AbstractTwo new types of greedy chains, strongly and semi-strongly greedy, in posets are defined and...
For a class of posets we establish that the f-vector of the chain polytope dominates the f-vector of...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
One question relating to partially ordered sets (posets) is that of partitioning or dividing the pos...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
The jump number of a partially ordered set (poset) P is the minimum number of incomparable adjacent ...
AbstractOnline chain partitioning problem of posets is open for at least last 15 years. The best kno...
AbstractIn this journal, Leclerc proved that the dimension of the partially ordered set consisting o...