论文信息 - The rank of a distributive lattice

The rank of a distributive lattice

Abstract The rank of a partial ordering P is the maximum size of an irredundant family of linear extensions of P whose intersection is P . A simple relationship is established between the rank of a finite distributive lattice and its subset of join irreducible elements.

I. Rabinovitch | I. Rival | I. Rival | I. Rabinovitch

[1] E. Szpilrajn. Sur l'extension de l'ordre partiel , 1930 .

[2] Ben Dushnik,et al. Partially Ordered Sets , 1941 .

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

[4] T. Hiraguchi. On the Dimension of Partially Ordered Sets. , 1951 .