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.
- Decidability and ℵ<sub>0</sub>-categoricity of theories of partially ordered sets (Q3882438) (← links)
- On the tame irreducible representations of orders<sup>1</sup> (Q3921359) (← links)
- Minimizing Setups for Cycle-Free Ordered Sets (Q3960747) (← links)
- Semiantichains and Unichain Coverings in Direct Products of Partial Orders (Q3966188) (← links)
- Cardinal Representations for Closures and Preclosures (Q3984298) (← links)
- Minimum decomposition of partially ordered sets into chains (Q4051928) (← links)
- Inequalities in Dimension Theory for Posets (Q4073407) (← links)
- The singular graph of lower triangular, nilpotent matrices (Q4155004) (← links)
- Entropy and phase transitions in partially ordered sets (Q4161359) (← links)
- Partitions Into Chains of a Class of Partially Ordered Sets (Q4172092) (← links)
- Computing and ranking measures of presortedness (Q4323402) (← links)
- Exhaustive testing of almost all devices with outputs depending on limited number of inputs (Q4391010) (← links)
- On the Jump Number of Lexicographic Sums of Ordered Sets (Q4429242) (← links)
- Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices (Q4554532) (← links)
- Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis (Q4571130) (← links)
- Broadcast Transmission to Prioritizing Receivers (Q4591231) (← links)
- Monotone Subsequences in High-Dimensional Permutations (Q4601054) (← links)
- ON THE COMPLEMENT OF THE ZERO-DIVISOR GRAPH OF A PARTIALLY ORDERED SET (Q4607002) (← links)
- On the dimension of vertex labeling of k-uniform dcsl of an even cycle (Q4634123) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
- A unified approach to known and unknown cases of Berge's conjecture (Q4650184) (← links)
- Iterated arc graphs (Q4683356) (← links)
- Rings that are sums of two locally nilpotent subrings (Q4714534) (← links)
- Intersection representation of digraphs in trees with few leaves (Q4719324) (← links)
- Changing the Depth of an Ordered Set by Decomposition (Q4723740) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- (Q4993799) (← links)
- (Q5002800) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)
- Lazy Queue Layouts of Posets (Q5014104) (← links)
- Recent developments on the power graph of finite groups – a survey (Q5016217) (← links)
- Graded ideals of König type (Q5020671) (← links)
- Weighted Rooted Trees: Fat or Tall? (Q5042262) (← links)
- (Q5077091) (← links)
- (Q5087460) (← links)
- On Grids in Point-Line Arrangements in the Plane (Q5088982) (← links)
- (Q5088986) (← links)
- Interval approximations of message causality in distributed executions (Q5096795) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- Graphs defined on groups (Q5102166) (← links)
- On the representation of finite distributive lattices (Q5125121) (← links)
- Dynamic Conflict-Free Colorings in the Plane (Q5136246) (← links)
- On the existence of small antichains for definable quasi-orders (Q5156470) (← links)
- A New Framework for Hierarchical Drawings (Q5233135) (← links)
- Estimates in Shirshov height theorem (Q5239608) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Plane 3-Trees: Embeddability and Approximation (Q5251619) (← links)
- On the Erdős-Szekeres convex polygon problem (Q5280069) (← links)
- Sperner's Problem for<i>G</i>-Independent Families (Q5364241) (← links)
- Easily Testable Graph Properties (Q5364250) (← links)