The following pages link to Order (Q172073):
Displaying 50 items.
- Varieties of lattice ordered groups that contain no non-Abelian o-groups are solvable (Q1821130) (← links)
- Semiorders and the 1/3-2/3 conjecture (Q1823267) (← links)
- Computing the dimension of N-free ordered sets is NP-complete (Q1824638) (← links)
- Planar acyclic oriented graphs (Q1825205) (← links)
- Non-axiomatizability of the amalgamation class of modular lattice varieties (Q1825215) (← links)
- Obituary: Ivan Rival (Q1826506) (← links)
- The zig-zag property and exponential cancellation of ordered sets (Q1826507) (← links)
- Whaley's theorem for finite lattices (Q1826508) (← links)
- Truncated distributive lattices: Conceptual structures of simple-implicational theories (Q1826509) (← links)
- Decomposing graphs into long paths (Q1826510) (← links)
- Orderings on graphs and game coloring number (Q1826511) (← links)
- On poset Boolean algebras (Q1826512) (← links)
- Scheduling rooted forests with communication delays (Q1842095) (← links)
- Towards the reconstruction of posets (Q1842096) (← links)
- Retractability and the fixed point property for products (Q1842097) (← links)
- Direct products of convex-ordinal scales (Q1842099) (← links)
- Affine complete distributive lattices (Q1842100) (← links)
- A Horn sentence for involution lattices of quasiorders (Q1842101) (← links)
- The projection onto the center of an \(\ell\)-algebra (Q1842102) (← links)
- Antichains in products of linear orders (Q1863070) (← links)
- Ohkuma structures (Q1863071) (← links)
- Combinatorial aspects of total weight orders over monomials of fixed degree (Q1863072) (← links)
- Enumerating order types for small point sets with applications (Q1863073) (← links)
- Examples on ordered set reconstruction (Q1863074) (← links)
- Polyadic concept analysis (Q1863075) (← links)
- Scheduling tasks with communication delays on parallel processors (Q1904382) (← links)
- On isotone functions with the substitution property in distributive lattices (Q1904383) (← links)
- The normalized matching property from the generalized Macaulay theorem (Q1904384) (← links)
- Back-and-forth for systems of antichains (Q1904385) (← links)
- Nonstandard analysis of ordered sets (Q1904386) (← links)
- Lattice uniformities and modular functions on orthomodular lattices (Q1904387) (← links)
- Subdifferentiation of monotone functions from semilattices to distributive lattices (Q1904389) (← links)
- The poset on connected induced subgraphs of a graph need not be Sperner (Q1904390) (← links)
- Upward planarity testing (Q1904391) (← links)
- Orientations of chain groups (Q1904392) (← links)
- The basic theorem of triadic concept analysis (Q1904393) (← links)
- From finite posets to chain complete posets having no infinite antichain (Q1904394) (← links)
- A family of \((n-1)!\) diagonal polynomial orders of \(N^ n\) (Q1904395) (← links)
- Boolean and distributive ordered sets: Characterization and representation by sets (Q1904396) (← links)
- In memoriam: Milan Kolibiar (1922-1994) (Q1908930) (← links)
- Balancing pairs and the cross product conjecture (Q1908931) (← links)
- The complexity of cover graph recognition for some varieties of finite lattices (Q1908932) (← links)
- Intervals in lattices of quasiorders (Q1908933) (← links)
- Automorphism group and dimension of ordered sets (Q1908934) (← links)
- Noetherian lattices in which every element is a product of primary elements (Q1908936) (← links)
- Obituary: R. P. Dilworth (Q1917666) (← links)
- The number of order-preserving maps between fences and crowns (Q1917667) (← links)
- The endomorphism spectrum of an ordered set (Q1917669) (← links)
- A loop-free algorithm for generating the linear extensions of a poset (Q1917670) (← links)
- Compatible connectedness in graphs and topological spaces (Q1917671) (← links)
