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.
- The Boolean rainbow Ramsey number of antichains, Boolean posets and chains (Q2213816) (← links)
- On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness (Q2225445) (← links)
- Balanced convex partitions of lines in the plane (Q2230924) (← links)
- Another note on Dilworth's decomposition theorem. (Q2249932) (← links)
- Empty monochromatic simplices (Q2250050) (← links)
- Antichains of \((0, 1)\)-matrices through inversions (Q2250943) (← links)
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem (Q2251909) (← links)
- On the geometric Ramsey number of outerplanar graphs (Q2256584) (← links)
- A theory of recursive dimension of ordered sets (Q2266723) (← links)
- The solid-metric dimension (Q2285129) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- Superrigidity of actions on finite rank median spaces (Q2313370) (← links)
- The Tits alternative for finite rank median spaces (Q2314869) (← links)
- On orthogonal symmetric chain decompositions (Q2325764) (← links)
- Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
- On decompositions of matrices over distributive lattices (Q2336217) (← links)
- Extreme points of the credal sets generated by comparative probabilities (Q2348072) (← links)
- On a conjecture of Füredi. (Q2349954) (← links)
- Linearly related polyominoes (Q2354049) (← links)
- The relation between the Jordan structure of a matrix and its graph (Q2365692) (← links)
- Erdős--Szekeres theorem with forbidden order types (Q2368653) (← links)
- Slim semimodular lattices. II: A description by patchwork systems (Q2376913) (← links)
- On-line chain partitioning of up-growing interval orders (Q2385526) (← links)
- Representing lattices using many-valued relations (Q2390385) (← links)
- Off-diagonal hypergraph Ramsey numbers (Q2396897) (← links)
- Tree-width and dimension (Q2400108) (← links)
- New characterisations of tree-based networks and proximity measures (Q2411310) (← links)
- Hierarchically hyperbolic spaces. II: Combination theorems and the distance formula (Q2420114) (← links)
- The width of downsets (Q2422228) (← links)
- On the multi-utility representation of preference relations (Q2427856) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Finite dimensional scattered posets (Q2434747) (← links)
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
- Moving averages in the plane (Q2441060) (← links)
- Embedding median algebras in products of trees. (Q2452176) (← links)
- Representations of primitive posets (Q2453365) (← links)
- Comparability graphs of lattices (Q2464520) (← links)
- Independent set of intersection graphs of convex objects in 2D (Q2489017) (← links)
- Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs (Q2520724) (← links)
- On Dilworth's coding theorem (Q2548969) (← links)
- Anti-blocking polyhedra (Q2549326) (← links)
- Maximal dimensional partially ordered sets. I: Hiraguchi's theorem (Q2560837) (← links)
- Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n (Q2560838) (← links)
- A characterization of bivariegated trees (Q2561600) (← links)
- The Tutte-Grothendieck ring (Q2562219) (← links)
- Bounding the number of circuits of a graph (Q2563510) (← links)
- Covering arrays on graphs (Q2565691) (← links)
- The multiple TSP with time windows: vehicle bounds based on precedence graphs (Q2583718) (← links)