A Decomposition Theorem for Partially Ordered Sets

1950/01/01 by R. P. Dilworth · 15 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Banach Space Theory #Combinatorics #Decomposition #Decomposition theorem #Discrete mathematics #Functional Equations Stability Results #Mathematics #Pure mathematics

paper · doi:10.2307/1969503

crossref issued 1950/01/01 · crossref published 1950/01/01 · crossref published-print 1950/01/01 · openalex publication_date 1950/01/01 · crossref created 2006/04/24 · crossref deposited 2018/05/08 · openalex created_date 2025/10/10 · crossref indexed 2026/08/05 · openalex updated_date 2026/08/05

Cited by

• Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing
• Viral Population Estimation Using Pyrosequencing
• The structure of sperner k-families
• Classic Papers in Combinatorics
• The dimension of planar posets
• On Path Cover Problems in Digraphs and Applications to Program Testing
• Layout of Graphs with Bounded Tree-Width
• String graphs and incomparability graphs
• Covering Pairs in Directed Acyclic Graphs
• On the arc-chromatic number of a digraph
• Superrigidity of actions on finite rank median spaces
• The Dilworth Theorems
• R. P. Dilworth
• Dilworth's theorem [wikipedia]
• Robert P. Dilworth [wikipedia]