A Dual of Dilworth's Decomposition Theorem
From MaRDI portal
Publication:5678900
DOI10.2307/2316481zbMath0263.06002OpenAlexW4252984977WikidataQ56430246 ScholiaQ56430246MaRDI QIDQ5678900
Publication date: 1971
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2316481
Related Items (52)
Isotonic regression with unknown permutations: statistics, computation and adaptation ⋮ Intersecting \(P\)-free families ⋮ Weighted Rooted Trees: Fat or Tall? ⋮ Lower and upper bounds for long induced paths in 3-connected planar graphs ⋮ Inference of boundaries in causal sets ⋮ \( \chi \)-diperfect digraphs ⋮ Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices ⋮ Tree-width and dimension ⋮ Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier ⋮ Alternating sign matrices, related (0,1)-matrices, and the Smith normal form ⋮ On dimension of poset variety ⋮ An algorithm for generating all maximal independent subsets of posets ⋮ Localized versions of extremal problems ⋮ Monotone Subsequences in High-Dimensional Permutations ⋮ A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell ⋮ ON THE COMPLEMENT OF THE ZERO-DIVISOR GRAPH OF A PARTIALLY ORDERED SET ⋮ Minimum decomposition of partially ordered sets into chains ⋮ AZ-identities and strict 2-part Sperner properties of product posets ⋮ On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders ⋮ On the dimension of vertex labeling of k-uniform dcsl of an even cycle ⋮ On the number of monotone sequences ⋮ An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times ⋮ Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game ⋮ De Bruijn-Erdős-type theorems for graphs and posets ⋮ An improvement of the general bound on the largest family of subsets avoiding a subposet ⋮ Antichains of \((0, 1)\)-matrices through inversions ⋮ Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ On the geometric Ramsey number of outerplanar graphs ⋮ A characteristic free approach to secant varieties of triple Segre products ⋮ Finite posets and Ferrers shapes ⋮ Partitions of sets of matrices ⋮ Unnamed Item ⋮ Toric partial orders ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ On the Power of Graph Searching for Cocomparability Graphs ⋮ Dimension and matchings in comparability and incomparability graphs. ⋮ Planar point sets determine many pairwise crossing segments ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Posets having a unique decomposition into the minimum number of antichains ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Monotonicity ⋮ On subgraphs of C2k-free graphs and a problem of Kühn and Osthus ⋮ Colouring set families without monochromatic \(k\)-chains ⋮ A generalization of Hanani's theorem on partial order ⋮ Interval orders, semiorders and ordered groups ⋮ Graph Classes and Forbidden Patterns on Three Vertices ⋮ Submodular functions and rooted trees ⋮ Leon Mirsky (1918--1983) ⋮ A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree ⋮ Order Preserving Maps and Linear Extensions of a Finite Poset ⋮ Derivations and Alberti representations
This page was built for publication: A Dual of Dilworth's Decomposition Theorem
