Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
From MaRDI portal
Publication:3234598
DOI10.2307/2033375zbMath0073.03803OpenAlexW4234024706WikidataQ56430243 ScholiaQ56430243MaRDI QIDQ3234598
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 graphs ⋮ Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended ⋮ Semiantichains and Unichain Coverings in Direct Products of Partial Orders ⋮ A proof of Dilworth's decomposition theorem for partially ordered sets ⋮ List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ Hamiltonian paths, unit-interval complexes, and determinantal facet ideals ⋮ Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis ⋮ Parallel dedicated machines scheduling with chain precedence constraints ⋮ A linear-time parameterized algorithm for computing the width of a DAG ⋮ Parameterizing path partitions ⋮ Topological Aspects of Matrix Abduction 2 ⋮ On chain and antichain families of a partially ordered set ⋮ Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width ⋮ A solution of the Sperner-Erdős problem ⋮ On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains ⋮ Another note on Dilworth's decomposition theorem. ⋮ Solution approaches for storage loading problems with stacking constraints ⋮ On partitions of a partially ordered set ⋮ On \(H\)-topological intersection graphs ⋮ Another proof of Dilworth's decomposition theorem ⋮ Representing triangulated graphs in stars ⋮ Systems of representatives ⋮ A poset-based approach to embedding median graphs in hypercubes and lattices ⋮ Computing possible and certain answers over order-incomplete data ⋮ Lattices of crosscuts ⋮ A bound for the Dilworth number
This page was built for publication: Note on Dilworth's Decomposition Theorem for Partially Ordered Sets