The following pages link to Ivan Rival (Q686306):
Displaying 50 items.
- Representing orders by moving figures in space (Q686307) (← links)
- Antichain cutsets (Q762182) (← links)
- Quotients of complete ordered sets (Q793061) (← links)
- Every countable lattice is a retract of a direct product of chains (Q797605) (← links)
- Enumerating orientations of ordered sets (Q803181) (← links)
- Drawing orders with few slopes (Q807654) (← links)
- Clones, order varieties, near unanimity functions and holes (Q810548) (← links)
- Diagrams, orientations, and varieties (Q911621) (← links)
- Retract rigid Cartesian products of graphs (Q912867) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Representing orders on the plane by translating points and lines (Q921023) (← links)
- (Q1061149) (redirect page) (← links)
- Greedy linear extensions to minimize jumps (Q1061150) (← links)
- Holes in ordered sets (Q1084421) (← links)
- Constructing greedy linear extensions by interchanging chains (Q1087566) (← links)
- Subdiagrams equal in number to their duals (Q1088695) (← links)
- Chains, antichains, and fibres (Q1098863) (← links)
- Representing orders on the plane by translating convex figures (Q1114721) (← links)
- Is there a diagram invariant? (Q1115889) (← links)
- The rank of a distributive lattice (Q1132904) (← links)
- Separable subsets of a finite lattice (Q1133561) (← links)
- Combinatorial inequalities for semimodular lattices of breadth two (Q1134169) (← links)
- The maximal size of the covering graph of a lattice (Q1134774) (← links)
- Lattice varieties covering the smallest non-modular variety (Q1134776) (← links)
- A note on weak embeddings of distributive lattices (Q1138004) (← links)
- A note on fixed points in semimodular lattices (Q1142792) (← links)
- Spanning retracts of a partially ordered set (Q1148926) (← links)
- A structure theory for ordered sets (Q1151913) (← links)
- Complete ordered sets with no infinite antichains (Q1155071) (← links)
- The smallest order variety containing all chains (Q1155636) (← links)
- A Ramsey-type theorem for traceable graphs (Q1160143) (← links)
- Exponents of lattice-ordered algebras (Q1171586) (← links)
- Order, genus, and diagram invariance (Q1182056) (← links)
- Light sources, obstructions and spherical orders (Q1193424) (← links)
- Lattices contained in planar orders are planar (Q1208077) (← links)
- A note on Whitman's property for free lattices (Q1212482) (← links)
- Dilworth's covering theorem for modular lattices: A simple proof (Q1215517) (← links)
- Certain partially ordered sets of dimension three (Q1218446) (← links)
- A characterization of semi-distributivity (Q1220090) (← links)
- An arithmetical theorem for modular lattices (Q1228492) (← links)
- Weak embeddings and embeddings of finite distributive lattices (Q1237787) (← links)
- A note on linear extensions of irreducible elements in a finite lattice (Q1237790) (← links)
- A fixed point theorem for finite partially orderes sets (Q1237994) (← links)
- Path length in the covering graph of a lattice (Q1244343) (← links)
- An exchange property for modular lattices (Q1252252) (← links)
- The complexity of upward drawings on spheres (Q1272953) (← links)
- Every triangle-free planar graph has a planar upward drawing (Q1311415) (← links)
- Perpendicular orders (Q1343793) (← links)
- Images of simple lattice polynomials (Q1344837) (← links)
- The pagenumber of spherical lattices is unbounded (Q1349068) (← links)
