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
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
AbstractTwo new types of greedy chains, strongly and semi-strongly greedy, in posets are defined and...
AbstractIn this paper, we show that if a partially ordered set has 2n elements and has dimension n, ...
Abstract. We consider the poset of all posets on n elements where the partial order is that of inclu...
AbstractWe consider the poset of all posets on n elements where the partial order is that of inclusi...
AbstractThe purpose of this paper is to discuss several invariants each of which provides a measure ...
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 ...
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...
This article presents an algorithm which computes the dimension of an arbitrary finite poset (partia...
This dissertation has three principal components. The first component is about the connections betwe...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
AbstractTwo new types of greedy chains, strongly and semi-strongly greedy, in posets are defined and...
AbstractIn this paper, we show that if a partially ordered set has 2n elements and has dimension n, ...
Abstract. We consider the poset of all posets on n elements where the partial order is that of inclu...
AbstractWe consider the poset of all posets on n elements where the partial order is that of inclusi...
AbstractThe purpose of this paper is to discuss several invariants each of which provides a measure ...
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 ...
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...
This article presents an algorithm which computes the dimension of an arbitrary finite poset (partia...
This dissertation has three principal components. The first component is about the connections betwe...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
AbstractTwo new types of greedy chains, strongly and semi-strongly greedy, in posets are defined and...
AbstractIn this paper, we show that if a partially ordered set has 2n elements and has dimension n, ...
DOI
Add to ORKG