summary:A construction is given which makes it possible to find all linear extensions of a given ordered set and, conversely, to find all orderings on a given set with a prescribed linear extension. Further, dense subsets of ordered sets are studied and a procedure is presented which extends a linear extension constructed on a dense subset to the whole set
SIGLEAvailable from British Library Document Supply Centre- DSC:D59952 / BLDSC - British Library Doc...
AbstractWe consider the problem of determining which partially ordered sets on n points with k pairs...
AbstractWe say that a linear ordering L is extendible if every partial ordering that does not embed ...
summary:A construction is given which makes it possible to find all linear extensions of a given ord...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...
AbstractWe find asymptotic upper and lower bounds on the number of linear extensions of the containm...
AbstractWe approximate the number of linear extensions of an ordered set by counting “critical” subo...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...
AbstractLoosely speaking, a greedy linear extension of an ordered set is a linear extension obtained...
AbstractWe find asymptotic upper and lower bounds on the number of linear extensions of the containm...
AbstractLoosely speaking, a greedy linear extension of an ordered set is a linear extension obtained...
We answer the question, when a partial order in a partially ordered algebraic structure has a compat...
AbstractWe approximate the number of linear extensions of an ordered set by counting “critical” subo...
AbstractWe prove a main theorem: Theorem. There always exists a minimal linearly ordered d-extension...
SIGLEAvailable from British Library Document Supply Centre- DSC:D59952 / BLDSC - British Library Doc...
AbstractWe consider the problem of determining which partially ordered sets on n points with k pairs...
AbstractWe say that a linear ordering L is extendible if every partial ordering that does not embed ...
summary:A construction is given which makes it possible to find all linear extensions of a given ord...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...
AbstractWe find asymptotic upper and lower bounds on the number of linear extensions of the containm...
AbstractWe approximate the number of linear extensions of an ordered set by counting “critical” subo...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...
AbstractLoosely speaking, a greedy linear extension of an ordered set is a linear extension obtained...
AbstractWe find asymptotic upper and lower bounds on the number of linear extensions of the containm...
AbstractLoosely speaking, a greedy linear extension of an ordered set is a linear extension obtained...
We answer the question, when a partial order in a partially ordered algebraic structure has a compat...
AbstractWe approximate the number of linear extensions of an ordered set by counting “critical” subo...
AbstractWe prove a main theorem: Theorem. There always exists a minimal linearly ordered d-extension...
SIGLEAvailable from British Library Document Supply Centre- DSC:D59952 / BLDSC - British Library Doc...
AbstractWe consider the problem of determining which partially ordered sets on n points with k pairs...
AbstractWe say that a linear ordering L is extendible if every partial ordering that does not embed ...
DOI
Add to ORKG