Pages that link to "Item:Q2648578"
From MaRDI portal
The following pages link to A decomposition theorem for partially ordered sets (Q2648578):
Displayed 47 items.
- Complete Amonotonic Decompositions of Compact Continua (Q5556422) (← links)
- Locally Convex Topological Lattices (Q5610408) (← links)
- Maximal Independent Collections of Closed Sets (Q5638998) (← links)
- Blocking and anti-blocking pairs of polyhedra (Q5668263) (← links)
- An Embedding Theorem for Compact Semilattices (Q5669961) (← links)
- On Decompositions of Partially Ordered Sets (Q5723210) (← links)
- Über reguläre Kettengruppen (Q5731398) (← links)
- (Q5743486) (← links)
- (Q5883508) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- Hasse Diagram Generators and Petri Nets (Q5902129) (← links)
- The structure of Sperner k-families (Q5905915) (← links)
- On the dimension of partially ordered sets (Q5905916) (← links)
- \(P\)-partition generating function equivalence of naturally labeled posets (Q5918206) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- Systems of representatives (Q5920823) (← links)
- Choice mappings of certain classes of finite sets (Q5921268) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
- Finite posets and Ferrers shapes (Q5937633) (← links)
- Generalized and geometric Ramsey numbers for cycles. (Q5941504) (← links)
- Compression using efficient multicasting (Q5952454) (← links)
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates (Q5961612) (← links)
- On the duality of semiantichains and unichain coverings. (Q5965139) (← links)
- Dimension and matchings in comparability and incomparability graphs. (Q5965146) (← links)
- The structure of Sperner k-families (Q5966939) (← links)
- Choice mappings of certain classes of finite sets (Q5971475) (← links)
- Balance constants for Coxeter groups (Q6062136) (← links)
- Fast reliability ranking of matchstick minimal networks (Q6065903) (← links)
- Uniform chain decompositions and applications (Q6074684) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Searching rigid data structures (Q6085739) (← links)
- Absolute retracts for finite distributive lattices and slim semimodular lattices (Q6105035) (← links)
- Unavoidable patterns in complete simple topological graphs (Q6117029) (← links)
- The chain covering number of a poset with no infinite antichains (Q6122520) (← links)
- Approximately counting and sampling knowledge states (Q6126887) (← links)
- On quantitative aspects of a canonisation theorem for edge‐orderings (Q6134551) (← links)
- Apéry sets and the ideal class monoid of a numerical semigroup (Q6141288) (← links)
- Twisted ways to find plane structures in simple drawings of complete graphs (Q6145668) (← links)
- Strongly algebraically closed \(p\)-semilattices (Q6147561) (← links)
- Chain algebras of finite distributive lattices (Q6152230) (← links)
- Dominance drawings for DAGs with bounded modular width (Q6169511) (← links)
- Subsequences in bounded ranges: matching and analysis problems (Q6173109) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
- On groups with chordal power graph, including a classification in the case of finite simple groups (Q6185342) (← links)
- Max-norm Ramsey theory (Q6201895) (← links)
- Ramsey numbers of cliques versus monotone paths (Q6201899) (← links)