Pages that link to "Item:Q2648578"
From MaRDI portal
The following pages link to A decomposition theorem for partially ordered sets (Q2648578):
Displayed 50 items.
- A proof of Dilworth's decomposition theorem for partially ordered sets (Q2625477) (← links)
- On Dilworth's theorem in the infinite case (Q2625478) (← links)
- Decompositions of the Boolean lattice into rank-symmetric chains. (Q2629495) (← links)
- Connected regular sublattices of Euclidean space (Q2639885) (← links)
- Two algorithms for LCS consecutive suffix alignment (Q2643733) (← links)
- New summary measures and datasets for the multi-project scheduling problem (Q2670516) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Odd-distance sets and right-equidistant sequences in the maximum and Manhattan metrics (Q2680431) (← links)
- The \(1/3-2/3\) Conjecture for Coxeter groups (Q2680921) (← links)
- Toric codes from order polytopes (Q2689244) (← links)
- Relating CAT(0) cubical complexes and flag simplicial complexes (Q2701014) (← links)
- Lazy queue layouts of posets (Q2701382) (← links)
- Toric partial orders (Q2787971) (← links)
- Topological Properties of Event Structures (Q2810963) (← links)
- Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems (Q2829966) (← links)
- The secretary problem on an unknown poset (Q2868083) (← links)
- On<i>n</i>×<i>n</i>matrices over a finite distributive lattice (Q2879642) (← links)
- News about Semiantichains and Unichain Coverings (Q2907485) (← links)
- Shared-Memory Systems and Charts (Q3007636) (← links)
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973) (← links)
- Matching and spanning in certain planar graphs (Q3043190) (← links)
- Multicollision attacks and generalized iterated hash functions (Q3068175) (← links)
- White Space Regions (Q3075521) (← links)
- Combinatorial Dichotomies in Set Theory (Q3083465) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- (Q3143773) (← links)
- Inference of boundaries in causal sets (Q3177400) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- The tensor product of distributive lattices: structural results (Q3222897) (← links)
- k-Quasi-Planar Graphs (Q3223960) (← links)
- Maximum-Minimum Sätze über Graphen (Q3252412) (← links)
- Well, Better and In-Between (Q3295144) (← links)
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders (Q3295145) (← links)
- Addendum to a paper of M. Saks (Q3310667) (← links)
- Extensions of functions of 0-1 variables and applications to combinatorial optimization (Q3337950) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- Partially ordered sets and the independence property (Q3476798) (← links)
- Borel Orderings (Q3487336) (← links)
- ON INCIDENCE MODULO IDEAL RINGS (Q3502759) (← links)
- The Hardness of Approximating Poset Dimension (Q3503501) (← links)
- A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
- SOME WEAKER FORMS OF THE CHAIN (<i>F</i>) CONDITION FOR METACOMPACTNESS (Q3520164) (← links)
- Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (Q3599136) (← links)
- Isometric Diamond Subgraphs (Q3611874) (← links)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
- On Path Partitions and Colourings in Digraphs (Q3655147) (← links)
- Optimal Linear Extensions by Interchanging Chains (Q3674720) (← links)
- Annual Meeting of the Association for Symbolic Logic Denver, 1983 (Q3686696) (← links)
- Examples of Jump-Critical Ordered Sets (Q3691788) (← links)
- Remarks on Dilworth's theorem in relation to transversal theory (Q3864571) (← links)