SIAM Journal on Computing · 1988 · 34 citations · 3 references
Natural SciencesComputer ScienceMathematicsCombinatoricsSet TheoryTheory Of ComputationPartial OrdersPartially Ordered SetsPattern RecognitionSorting AlgorithmsSorting ProblemsOrder IsomorphismsRecognition Problems
How many questions are needed to decide whether an unknown ordered set is isomorphic to a fixed ordered set $P_0 $? This recognition problem is considered, together with some related computational problems concerning ordered sets.
3
A Decomposition Theorem for Partially Ordered Sets
R. P. Dilworth · Annals of Mathematics · 1950 · 987 citations
On the dimension of partially ordered sets
David Kelly · Discrete Mathematics · 1981 · 77 citations
The rank of a distributive lattice
Issie Rabinovitch, Ivan Rival · Discrete Mathematics · 1979 · 38 citations