A decomposition theorem for partially ordered sets
From MaRDI portal
Publication:2648578
DOI10.2307/1969503zbMath0038.02003OpenAlexW4254807835WikidataQ30040757 ScholiaQ30040757MaRDI QIDQ2648578
Publication date: 1950
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1969503
Related Items (only showing first 100 items - show all)
On the Erdős-Szekeres convex polygon problem ⋮ Semiantichains and Unichain Coverings in Direct Products of Partial Orders ⋮ Weighted Rooted Trees: Fat or Tall? ⋮ A proof of Dilworth's decomposition theorem for partially ordered sets ⋮ On Dilworth's theorem in the infinite case ⋮ Decompositions of the Boolean lattice into rank-symmetric chains. ⋮ Partitions Into Chains of a Class of Partially Ordered Sets ⋮ Inference of boundaries in causal sets ⋮ News about Semiantichains and Unichain Coverings ⋮ Connected regular sublattices of Euclidean space ⋮ Pairwise Compatibility Graphs: A Survey ⋮ Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices ⋮ Changing the Depth of an Ordered Set by Decomposition ⋮ Two algorithms for LCS consecutive suffix alignment ⋮ Estimates in Shirshov height theorem ⋮ Partially ordered sets and the independence property ⋮ Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis ⋮ New summary measures and datasets for the multi-project scheduling problem ⋮ A linear-time parameterized algorithm for computing the width of a DAG ⋮ Interval approximations of message causality in distributed executions ⋮ Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier ⋮ The tensor product of distributive lattices: structural results ⋮ k-Quasi-Planar Graphs ⋮ Broadcast Transmission to Prioritizing Receivers ⋮ Unnamed Item ⋮ ON INCIDENCE MODULO IDEAL RINGS ⋮ The Hardness of Approximating Poset Dimension ⋮ Odd-distance sets and right-equidistant sequences in the maximum and Manhattan metrics ⋮ The \(1/3-2/3\) Conjecture for Coxeter groups ⋮ Computing and ranking measures of presortedness ⋮ Unnamed Item ⋮ A Path Cover Technique for LCAs in Dags ⋮ Monotone Subsequences in High-Dimensional Permutations ⋮ Toric codes from order polytopes ⋮ Sperner's Problem forG-Independent Families ⋮ Easily Testable Graph Properties ⋮ Maximum-Minimum Sätze über Graphen ⋮ ON THE COMPLEMENT OF THE ZERO-DIVISOR GRAPH OF A PARTIALLY ORDERED SET ⋮ Minimum decomposition of partially ordered sets into chains ⋮ SOME WEAKER FORMS OF THE CHAIN (F) CONDITION FOR METACOMPACTNESS ⋮ Relating CAT(0) cubical complexes and flag simplicial complexes ⋮ Lazy queue layouts of posets ⋮ Optimal Linear Extensions by Interchanging Chains ⋮ Intersection representation of digraphs in trees with few leaves ⋮ Minimizing Setups for Cycle-Free Ordered Sets ⋮ Well, Better and In-Between ⋮ 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 ⋮ Shared-Memory Systems and Charts ⋮ Addendum to a paper of M. Saks ⋮ On the existence of small antichains for definable quasi-orders ⋮ A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths ⋮ Cardinal Representations for Closures and Preclosures ⋮ A unified approach to known and unknown cases of Berge's conjecture ⋮ APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS ⋮ Graphs defined on groups ⋮ Exhaustive testing of almost all devices with outputs depending on limited number of inputs ⋮ Extensions of functions of 0-1 variables and applications to combinatorial optimization ⋮ Unnamed Item ⋮ Transitive-Closure Spanners: A Survey ⋮ Matching and spanning in certain planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems ⋮ Remarks on Dilworth's theorem in relation to transversal theory ⋮ Unnamed Item ⋮ Toric partial orders ⋮ Iterated arc graphs ⋮ The singular graph of lower triangular, nilpotent matrices ⋮ Entropy and phase transitions in partially ordered sets ⋮ On the representation of finite distributive lattices ⋮ On the Jump Number of Lexicographic Sums of Ordered Sets ⋮ Isometric Diamond Subgraphs ⋮ Borel Orderings ⋮ Multicollision attacks and generalized iterated hash functions ⋮ Decidability and ℵ0-categoricity of theories of partially ordered sets ⋮ White Space Regions ⋮ Topological Properties of Event Structures ⋮ Combinatorial Dichotomies in Set Theory ⋮ Rings that are sums of two locally nilpotent subrings ⋮ Pomset Languages of Finite Step Transition Systems ⋮ On Grids in Point-Line Arrangements in the Plane ⋮ Inequalities in Dimension Theory for Posets ⋮ Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems ⋮ A New Framework for Hierarchical Drawings ⋮ On Path Partitions and Colourings in Digraphs ⋮ On the tame irreducible representations of orders1 ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Acyclic Digraphs ⋮ Plane 3-Trees: Embeddability and Approximation ⋮ A survey on pairwise compatibility graphs ⋮ Lazy Queue Layouts of Posets ⋮ Recent developments on the power graph of finite groups – a survey ⋮ Geometric Thickness in a Grid of Linear Area ⋮ The secretary problem on an unknown poset ⋮ Graded ideals of König type ⋮ Annual Meeting of the Association for Symbolic Logic Denver, 1983 ⋮ Dynamic Conflict-Free Colorings in the Plane ⋮ Examples of Jump-Critical Ordered Sets ⋮ Onn×nmatrices over a finite distributive lattice
This page was built for publication: A decomposition theorem for partially ordered sets
