The following pages link to Order (Q172073):
Displaying 50 items.
- Jump number and width (Q1103654) (← links)
- Substitution and atomic extension on greedy posets (Q1104347) (← links)
- Posets with interval upper bound graphs (Q1104348) (← links)
- Representing an ordered set as the intersection of super greedy linear extensions (Q1104948) (← links)
- The poset of closures as a model of changing databases (Q1104951) (← links)
- Rational preemptive scheduling (Q1105366) (← links)
- Samuel Wolfenstein in memoriam (Q1105574) (← links)
- Fixed points of products and the strong fixed point property (Q1106249) (← links)
- Computing the bump number is easy (Q1106863) (← links)
- Computing the bump number with techniques from two-processor scheduling (Q1106865) (← links)
- Degrees of freedom versus dimension for containment orders (Q1106866) (← links)
- The fundamental duality of partially ordered sets (Q1107550) (← links)
- Edge subdivision and dimension (Q1108295) (← links)
- Irrational ordered groups (Q1108299) (← links)
- Dimension versus size (Q1109056) (← links)
- A minimax theorem for chain complete ordered sets (Q1109795) (← links)
- On the dimensions of ordered sets of bounded degree (Q1109797) (← links)
- Lexicographic matchings cannot form Hamiltonian cycles (Q1110538) (← links)
- \(\kappa\)-embeddings of ordered sets (Q1110545) (← links)
- A notion of branching rank for semilattices with descending chain condition (Q1110547) (← links)
- Maximal words connected with unimodal maps (Q1110551) (← links)
- On minimizing the jump number for interval orders (Q1111581) (← links)
- Transversally bounded lattices (Q1111582) (← links)
- Circle orders, n-gon orders and the crossing number (Q1112075) (← links)
- Combinatorial representation and convex dimension of convex geometries (Q1112077) (← links)
- Obituary: Evelyn M. Nelson (Q1112800) (← links)
- On the width of an orientation of a tree (Q1112850) (← links)
- Dimension may exceed width (Q1112851) (← links)
- The number of linear extensions of bipartite graphs (Q1114718) (← links)
- Interval orders and circle orders (Q1114720) (← links)
- Representing orders on the plane by translating convex figures (Q1114721) (← links)
- A short proof that \(N^ 3\) is not a circle containment order (Q1115459) (← links)
- Normal subgroups and elementary theories of lattice-ordered groups (Q1115464) (← links)
- Cancellation and absorption of lexicographic powers of totally ordered Abelian groups (Q1115465) (← links)
- Decompositions of partially ordered sets into chains and antichains of given size (Q1115890) (← links)
- On circle containment orders (Q1117256) (← links)
- Explicit matchings in the middle levels of the Boolean lattice (Q1117950) (← links)
- Gluings of modular lattices (Q1118624) (← links)
- Forbidden configurations for distributive and modular ordered sets (Q1121294) (← links)
- A counterexample in the theory of random orders (Q1121295) (← links)
- Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices (Q1121297) (← links)
- Planar graphs and poset dimension (Q1121926) (← links)
- Asymptotic enumeration of two-dimensional posets (Q1122599) (← links)
- Minimally generated Boolean algebras (Q1122604) (← links)
- Maximal chains and cutsets of an ordered set: A Menger type approach (Q1123914) (← links)
- The Menger property for infinite ordered sets (Q1123915) (← links)
- Angle orders and zeros (Q1176975) (← links)
- Constructions of \(S\)-lattices (Q1176977) (← links)
- Realizable posets (Q1176978) (← links)
- Self complementary topologies and preorders (Q1177704) (← links)
