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.
- Irreducibility and generation in continuous lattices (Q1236555) (← links)
- Equational axioms for classes of Heyting algebras (Q1237072) (← links)
- Weak embeddings and embeddings of finite distributive lattices (Q1237787) (← links)
- Covering digraphs by paths (Q1250116) (← links)
- Another proof of Dilworth's decomposition theorem (Q1252854) (← links)
- Skew chain orders and sets of rectangles (Q1258741) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- Parametrization of knowledge structures (Q1264001) (← links)
- On the n-cutset property (Q1264162) (← links)
- Covering a symmetric poset by symmetric chains (Q1272179) (← links)
- Varieties of solvable Lie rings of finite width (Q1280621) (← links)
- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers (Q1297441) (← links)
- On the dimension of ordered sets with the 2-cutset property (Q1311419) (← links)
- Finite labelling problem in event structures (Q1314399) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- Covering a poset by interval orders (Q1323838) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- Some geometric applications of Dilworth's theorem (Q1330876) (← links)
- Families of sets with locally bounded width (Q1334941) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- Algorithms constructing a representive vector criterion for a binary preference relation (Q1343006) (← links)
- Paths in directed graphs and spectral properties of matrices (Q1344068) (← links)
- On the fractional dimension of partially ordered sets (Q1344614) (← links)
- Optimally balancing assembly lines with different workstations (Q1348257) (← links)
- A theory of nonmonotonic rule systems. II (Q1354038) (← links)
- A theory of nonmonotonic rule systems I (Q1356221) (← links)
- Families of chains of a poset and Sperner properties (Q1356768) (← links)
- Switchdec polyhedra (Q1363748) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- The Ramsey numbers r(P\(_m\),K\(_n\)) (Q1394238) (← links)
- Local coherence. (Q1412833) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- An improved algorithm for the jump number problem (Q1603444) (← links)
- Dynamic conflict-free colorings in the plane (Q1631778) (← links)
- Minimal generation of transitive permutation groups (Q1643178) (← links)
- A general theorem on temporal foliations of causal sets (Q1643515) (← links)
- Passive testing with asynchronous communications and timestamps (Q1656880) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- Trees and circle orders (Q1688275) (← links)
- A lattice-theoretical characterization of the family of cut sets of interval-valued fuzzy sets (Q1697976) (← links)
- Maximum antichains in posets of quiver representations (Q1702138) (← links)
- COMs: complexes of oriented matroids (Q1703453) (← links)
- Long cycles in Hamiltonian graphs (Q1717607) (← links)
- Airplane boarding meets express line queues (Q1719647) (← links)
- The queue-number of posets of bounded width or height (Q1725753) (← links)
- Algorithms and bounds for drawing directed graphs (Q1725793) (← links)
- Commutative algebra of generalised Frobenius numbers (Q1726039) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- Anchored reactive and proactive solutions to the CPM-scheduling problem (Q1753557) (← links)
- Exact and heuristic methods for solving the robotic assembly line balancing problem (Q1754736) (← links)