Obituary: Ivan Rival
From MaRDI portal
Publication:1826506
DOI10.1023/B:ORDE.0000026602.94442.32zbMath1089.01515OpenAlexW2069325129WikidataQ56518261 ScholiaQ56518261MaRDI QIDQ1826506
Publication date: 6 August 2004
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:orde.0000026602.94442.32
Cites Work
- Lattices with Doubly Irreducible Elements
- Finite Four-Generated Simple Lattices Contain All Finite Lattices
- Planar Lattices
- Sublattices of Modular Lattices of Finite Length
- Critical Edges in Subdirectly Irreducible Lattices
- Structure Results for Function Lattices
- Exponents of Finite Simple Lattices
- Planar Sublattices of a Free Lattice. I
- A Note on the Congruence Lattice of a Finitely Generated Algebra
- Planar Sublattices of a Free Lattice. II
- The Spectrum of a Finite Lattice: Breadth and Length Techniques
- Small Representations of Finite Distributive Lattices as Congruence Lattice
- Permutation Schedules for Flow Shops with Precedence Constraints
- Maximal Sublattices of Finite Distributive Lattices
- Maximal Sublattices of Finite Distributive Lattices. II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representing orders by moving figures in space
- Antichain cutsets
- Quotients of complete ordered sets
- Every countable lattice is a retract of a direct product of chains
- Enumerating orientations of ordered sets
- Drawing orders with few slopes
- Clones, order varieties, near unanimity functions and holes
- Diagrams, orientations, and varieties
- Retract rigid Cartesian products of graphs
- Bipartite graphs, upward drawings, and planarity
- Representing orders on the plane by translating points and lines
- Greedy linear extensions to minimize jumps
- Holes in ordered sets
- Constructing greedy linear extensions by interchanging chains
- Subdiagrams equal in number to their duals
- Chains, antichains, and fibres
- Representing orders on the plane by translating convex figures
- Is there a diagram invariant?
- The rank of a distributive lattice
- Separable subsets of a finite lattice
- Combinatorial inequalities for semimodular lattices of breadth two
- The maximal size of the covering graph of a lattice
- Lattice varieties covering the smallest non-modular variety
- A note on weak embeddings of distributive lattices
- A note on fixed points in semimodular lattices
- Spanning retracts of a partially ordered set
- A structure theory for ordered sets
- Complete ordered sets with no infinite antichains
- The smallest order variety containing all chains
- A Ramsey-type theorem for traceable graphs
- Exponents of lattice-ordered algebras
- Order, genus, and diagram invariance
- Light sources, obstructions and spherical orders
- Lattices contained in planar orders are planar
- A note on Whitman's property for free lattices
- Dilworth's covering theorem for modular lattices: A simple proof
- Certain partially ordered sets of dimension three
- A characterization of semi-distributivity
- An arithmetical theorem for modular lattices
- Weak embeddings and embeddings of finite distributive lattices
- A note on linear extensions of irreducible elements in a finite lattice
- A fixed point theorem for finite partially orderes sets
- Path length in the covering graph of a lattice
- An exchange property for modular lattices
- The complexity of upward drawings on spheres
- Every triangle-free planar graph has a planar upward drawing
- Perpendicular orders
- Images of simple lattice polynomials
- The pagenumber of spherical lattices is unbounded
- Dimension two, fixed points and dismantlable ordered sets
- Approximating the number of linear extensions
- Crooked diagrams with few slopes
- Greedy linear extensions with constraints
- The smallest graph variety containing all paths
- On a class of isometric subgraphs of a graph
- Finite sublattices generated by order-isomorphic subsets
- Automorphisms, isotone self-maps and cycle-free orders
- A generalized permutahedron
- The endomorphism spectrum of an ordered set
- Projective images of modular (distributive, complemented) lattices are modular (distributive, complemented)
- Inversions, cuts, and orientations
- Orders with level diagrams
- Dimension invariance of subdivisions
- Absolute Retracts and Varieties of Reflexive Graphs
- Crowns, Fences, and Dismantlable Lattices
- Motion Planning,Two-Directional Point Representation, and Ordered Sets
- Graphs Orientable as Distributive Lattices
- Optimal Linear Extensions by Interchanging Chains
- Examples of Jump-Critical Ordered Sets
- Antichains and Finite Sets that Meet all Maximal Chains
- A Classification of Reflexive Graphs: The use of “Holes”
- On the Adjacency of Vertices to the Vertices of an Infinite Subgraph
- Fixed-edge theorem for graphs with loops
- Retracts and the Fixed Point Problem for Finite Partially Ordered Sets
- The Problem of Fixed Points in Ordered Sets
- Continuous, Slope-Preserving Maps of Simple Closed Curves
- On the Ubiquity of Herringbones in Finitely Generated Lattices
- Which Ordered Sets have a Complete Linear Extension?
- Pictures in Lattice Theory
- Minimizing Setups for Cycle-Free Ordered Sets
- A Logarithmic Property for Exponents of Partially Ordered Sets
This page was built for publication: Obituary: Ivan Rival
