论文信息 - Directed Tree Decompositions

Directed Tree Decompositions

In the problem session of the ICFCA 2006, Sandor Radeleczki asked for the meaning of the smallest integer k such that a given poset can be decomposed as the union of k directed trees. The problem also asks for the connection of this number to the order dimension. Since it was left open what kind of decomposition might be used, there is more than one reading of this problem. In the paper, we discuss different versions and give some answers to this open problem.

Sebastian Kerkhoff | Friedrich Martin Schneider

[1] L. Mirsky. A Dual of Dilworth's Decomposition Theorem , 1971 .

[2] W. Trotter,et al. Combinatorics and Partially Ordered Sets: Dimension Theory , 1992 .

[3] T. Hiraguchi. On the Dimension of Orders , 1955 .

[4] Notes on CD-independent subsets , 2012, Acta Scientiarum Mathematicarum.

[5] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .