A decomposition theorem for partially ordered sets
From MaRDI portal
Publication:2648578
DOI10.2307/1969503zbMath0038.02003OpenAlexW4254807835WikidataQ30040757 ScholiaQ30040757MaRDI QIDQ2648578
No author found.
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)
Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets ⋮ Maximum-sized antichains in minimal posets ⋮ Polyhedral proof methods in combinatorial optimization ⋮ On k-optimum dipath partitions and partial k-colourings of acyclic digraphs ⋮ Decomposing weighted digraphs into sums of chains ⋮ Empty monochromatic triangles ⋮ Forcing posets with large dimension to contain large standard examples ⋮ Monochromatic directed walks in arc-colored directed graphs ⋮ Alternating orientation and alternating colouration of perfect graphs ⋮ A note on Dilworth's theorem in the infinite case ⋮ Optimal space coverage with white convex polygons ⋮ Lines, betweenness and metric spaces ⋮ Ramsey-type theorems for sets satisfying a geometric regularity condition ⋮ Algorithms for some graph theoretical optimization problems (abstract of thesis) ⋮ A bipartite analogue of Dilworth's theorem ⋮ An extended framework for passive asynchronous testing ⋮ A structure theorem for posets admitting a ``strong chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities) ⋮ On the maximum even factor in weakly symmetric graphs ⋮ Approximate min-max relations for odd cycles in planar graphs ⋮ Maximum union-free subfamilies ⋮ The variety generated by planar modular lattices ⋮ The zero-divisor graphs of posets and an application to semigroups ⋮ Turán-type results for partial orders and intersection graphs of convex sets ⋮ Alternating paths along axis-parallel segments ⋮ Weak sense of direction labelings and graph embeddings ⋮ New bounds on the maximum number of edges in \(k\)-quasi-planar graphs ⋮ An Erdős-Gallai theorem for matroids ⋮ Generalized Robinson-Schensted-Knuth correspondence ⋮ Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices ⋮ Erdős-Szekeres theorem for point sets with forbidden subconfigurations ⋮ The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices ⋮ Lower bounds for randomized algorithms for online chain partitioning ⋮ An extremal problem on crossing vectors. ⋮ Partially ordered sets and stratification ⋮ Some order dimension bounds for communication complexity problems ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ Geodesics in CAT(0) cubical complexes ⋮ Linear discrepancy of chain products and posets with bounded degree ⋮ Partitioning a weighted partial order ⋮ Binary relations: Finite characterizations and computational complexity ⋮ On the number of monotone sequences ⋮ On the geometric Ramsey numbers of trees ⋮ Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game ⋮ Perfect zero-divisor graphs ⋮ Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture ⋮ On Linial's conjecture for spine digraphs ⋮ Preperfect graphs ⋮ Cut-sets in infinite graphs and partial orders ⋮ On Greene-Kleitman's theorem for general digraphs ⋮ Finding the largest suborder of fixed width ⋮ Utility representation of an incomplete preference relation ⋮ Minimum vertex cover in rectangle graphs ⋮ Finding common structured patterns in linear graphs ⋮ Project scheduling with irregular costs: complexity, approximability, and algorithms ⋮ A Nice labelling for tree-like event structures of degree 3 ⋮ Scheduling tasks with exponential duration on unrelated parallel machines ⋮ Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes ⋮ On switching paths polyhedra ⋮ Two easy duality theorems for product partial orders ⋮ Some inequalities for partial orders ⋮ NP-completeness properties about linear extensions ⋮ Cyclic orders ⋮ On the lattice of maximum-sized antichains of a finite poset ⋮ Pfaffian systems of \(A\)-hypergeometric equations. I: Bases of twisted cohomology groups. ⋮ Utility representation of lower separable preferences ⋮ A Ramsey-type result for geometric \(\ell\)-hypergraphs ⋮ Optimal conclusive sets for comparator networks ⋮ Property \(A\) and \(\text{CAT}(0)\) cube complexes. ⋮ Duality for semiantichains and unichain coverings in products of special posets ⋮ Computational complexity of some scheduling problems with multiprocessor tasks ⋮ A min-max relation for the partial q-colourings of a graph. II: Box perfection ⋮ Monotonicity ⋮ Antichain cutsets ⋮ A poset-based approach to embedding median graphs in hypercubes and lattices ⋮ The matrix of a slim semimodular lattice ⋮ On the chromatic number of disjointness graphs of curves ⋮ A bipartite analogue of Dilworth's theorem for multiple partial orders ⋮ A polynomial bound for untangling geometric planar graphs ⋮ On generalized Schur numbers of the equation \(x+ay=z\) ⋮ Perfectness and imperfectness of unit disk graphs on triangular lattice points ⋮ Comparing Dushnik-Miller dimension, Boolean dimension and local dimension ⋮ On geometric graph Ramsey numbers ⋮ Using formal verification to evaluate the execution time of Spark applications ⋮ How to derive finite semimodular lattices from distributive lattices? ⋮ Distributive Cauchy lattices ⋮ Uniqueness of linear extensions of partial orders ⋮ Enumerating fuzzy switching functions and free Kleene algebras ⋮ The Sperner property for posets: A probabilistic approach ⋮ Networks and chain coverings in partial orders and their products ⋮ On the computational complexity of path cover problems ⋮ Path-closed sets ⋮ Finite cutsets and finite antichains ⋮ On the size of jump-critical ordered sets ⋮ Inequalities for the greedy dimensions of ordered sets ⋮ On partitions and presortedness of sequences ⋮ A bound for the Dilworth number ⋮ On the complexity of a family of generalized matching problems ⋮ ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible ⋮ Decomposing a set of points into chains, with applications to permutation and circle graphs ⋮ Some sequences associated with combinatorial structures
This page was built for publication: A decomposition theorem for partially ordered sets
