Note on Dilworth's Decomposition Theorem for Partially Ordered Sets

From MaRDI portal
Revision as of 22:03, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3234598

DOI10.2307/2033375zbMath0073.03803OpenAlexW4234024706WikidataQ56430243 ScholiaQ56430243MaRDI QIDQ3234598

D. R. Fulkerson

Publication date: 1956

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2033375




Related Items (26)

On claw-free asteroidal triple-free graphsUsing Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining ExtendedSemiantichains and Unichain Coverings in Direct Products of Partial OrdersA proof of Dilworth's decomposition theorem for partially ordered setsList scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibilityHamiltonian paths, unit-interval complexes, and determinantal facet idealsFinding Boundary Elements in Ordered Sets with Application to Safety and Requirements AnalysisParallel dedicated machines scheduling with chain precedence constraintsA linear-time parameterized algorithm for computing the width of a DAGParameterizing path partitionsTopological Aspects of Matrix Abduction 2On chain and antichain families of a partially ordered setScheduling and packing malleable and parallel tasks with precedence constraints of bounded widthA solution of the Sperner-Erdős problemOn-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chainsAnother note on Dilworth's decomposition theorem.Solution approaches for storage loading problems with stacking constraintsOn partitions of a partially ordered setOn \(H\)-topological intersection graphsAnother proof of Dilworth's decomposition theoremRepresenting triangulated graphs in starsSystems of representativesA poset-based approach to embedding median graphs in hypercubes and latticesComputing possible and certain answers over order-incomplete dataLattices of crosscutsA bound for the Dilworth number







This page was built for publication: Note on Dilworth's Decomposition Theorem for Partially Ordered Sets