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.
- On some structural properties of a subclass of \(\infty\)-regular languages (Q1098324) (← links)
- Substitution and atomic extension on greedy posets (Q1104347) (← links)
- How robust is the n-cube? (Q1104728) (← links)
- Locally perfect graphs (Q1105623) (← links)
- A chain decomposition theorem (Q1109796) (← links)
- Two-sided cells in the affine Weyl group of type \(\tilde A_{n-1}\) (Q1115530) (← links)
- Decompositions of partially ordered sets into chains and antichains of given size (Q1115890) (← links)
- Problems on chain partitions (Q1115891) (← links)
- Maximal chains and cutsets of an ordered set: A Menger type approach (Q1123914) (← links)
- A note on perfect orders (Q1124614) (← links)
- ERCW PRAMs and optical communication (Q1128717) (← links)
- The rank of a distributive lattice (Q1132904) (← links)
- Combinatorial inequalities for semimodular lattices of breadth two (Q1134169) (← links)
- Zur Theorie der perfekten Graphen (Q1134773) (← links)
- A partition theorem for ordinals (Q1135852) (← links)
- A short proof of the existence of k-saturated partitions of partially ordered sets (Q1137582) (← links)
- On chains and Sperner k-families in ranked posets (Q1139061) (← links)
- On chain and antichain families of a partially ordered set (Q1144050) (← links)
- A construction for partially ordered sets (Q1145708) (← links)
- Efficient searching using partial ordering (Q1151264) (← links)
- A structure theory for ordered sets (Q1151913) (← links)
- Extending the Greene-Kleitman theorem to directed graphs (Q1155625) (← links)
- On the arc-chromatic number of a digraph (Q1158161) (← links)
- The metacompactness of spaces with bases of subinfinite rank (Q1158662) (← links)
- k-optimal partitions of a directed graph (Q1172068) (← links)
- Realizable posets (Q1176978) (← links)
- Efficient \(q\)-ary immutable codes (Q1180148) (← links)
- Concerning the size of logical clocks in distributed systems (Q1182109) (← links)
- A greedy reduction algorithm for setup optimization (Q1183348) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Gallai-Milgram properties for infinite graphs (Q1191912) (← links)
- Maximum and minimum jump number of posets from matrices (Q1194526) (← links)
- Coflow polyhedra (Q1197009) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Changing and unchanging the diameter of a hypercube (Q1199429) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- Search and sweep numbers of finite directed acyclic graphs (Q1208460) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- Irreducible posets with large height exist (Q1212023) (← links)
- An extension of Schensted's theorem (Q1216397) (← links)
- The dimension of planar posets (Q1217722) (← links)
- Dimension of the crown \(S^k_n\) (Q1219308) (← links)
- Embedding finite posets in cubes (Q1219897) (← links)
- Some theorems on graphs and posets (Q1223323) (← links)
- Some partitions associated with a partially ordered set (Q1224110) (← links)
- Symmetrische Zerlegung von Kettenprodukten (Q1226101) (← links)
- On formal fractions associated with the symmetric groups (Q1229247) (← links)
- On Dilworth's decomposition theorem (Q1230802) (← links)
- On the complexity of posets (Q1235192) (← links)