10 search results - page 1 / 2 » Partitioning Posets |
DM
2008
13 years 4 months ago
2008
Let m 2 be an integer. We say that a poset P = (X, ) is m-partite if X has a partition X = X1
ORDER
2007
13 years 4 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
ARSCOM
2006
13 years 4 months ago
2006
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
ORDER
2008
13 years 4 months ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
COMBINATORICS
2006
13 years 4 months ago
2006
We prove analogues for sub-posets of the Dowling lattices of the results of Calderbank, Hanlon, and Robinson on homology of sub-posets of the partition lattices. The technical too...