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.
- Forcing posets with large dimension to contain large standard examples (Q293603) (← links)
- Optimal space coverage with white convex polygons (Q306074) (← links)
- Lines, betweenness and metric spaces (Q312159) (← links)
- Ramsey-type theorems for sets satisfying a geometric regularity condition (Q342924) (← links)
- An extended framework for passive asynchronous testing (Q347402) (← links)
- Maximum union-free subfamilies (Q375829) (← links)
- An Erdős-Gallai theorem for matroids (Q434226) (← links)
- Representing homomorphisms of distributive lattices as restrictions of congruences of rectangular lattices (Q451078) (← links)
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
- Lower bounds for randomized algorithms for online chain partitioning (Q456079) (← links)
- An extremal problem on crossing vectors. (Q458279) (← links)
- Partially ordered sets and stratification (Q459398) (← links)
- Linear discrepancy of chain products and posets with bounded degree (Q466867) (← links)
- On the number of monotone sequences (Q490988) (← links)
- On the geometric Ramsey numbers of trees (Q501079) (← links)
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (Q503156) (← links)
- Perfect zero-divisor graphs (Q507501) (← links)
- On Linial's conjecture for spine digraphs (Q512554) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- On switching paths polyhedra (Q579630) (← links)
- Two easy duality theorems for product partial orders (Q580378) (← links)
- Some inequalities for partial orders (Q580381) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- Cyclic orders (Q583246) (← links)
- On the lattice of maximum-sized antichains of a finite poset (Q585231) (← links)
- On the maximum even factor in weakly symmetric graphs (Q598466) (← links)
- The variety generated by planar modular lattices (Q607450) (← links)
- The zero-divisor graphs of posets and an application to semigroups (Q607688) (← links)
- Turán-type results for partial orders and intersection graphs of convex sets (Q607823) (← links)
- Weak sense of direction labelings and graph embeddings (Q628312) (← links)
- The Jordan-Hölder theorem with uniqueness for groups and semimodular lattices (Q647323) (← links)
- Geodesics in CAT(0) cubical complexes (Q651054) (← links)
- Preperfect graphs (Q684406) (← links)
- Cut-sets in infinite graphs and partial orders (Q686154) (← links)
- On Greene-Kleitman's theorem for general digraphs (Q687099) (← links)
- Finding the largest suborder of fixed width (Q687176) (← links)
- Utility representation of an incomplete preference relation (Q697961) (← links)
- Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Pfaffian systems of \(A\)-hypergeometric equations. I: Bases of twisted cohomology groups. (Q728223) (← links)
- A Ramsey-type result for geometric \(\ell\)-hypergraphs (Q740277) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- Monotonicity (Q758572) (← links)
- Antichain cutsets (Q762182) (← links)
- A poset-based approach to embedding median graphs in hypercubes and lattices (Q766140) (← links)
- The matrix of a slim semimodular lattice (Q766150) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- On generalized Schur numbers of the equation \(x+ay=z\) (Q780504) (← links)
- Comparing Dushnik-Miller dimension, Boolean dimension and local dimension (Q781526) (← links)