A structure theory for ordered sets
From MaRDI portal
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- A characterization of complete lattices
- A decomposition theorem for partially ordered sets
- A fixed point theorem for finite partially orderes sets
- A lattice-theoretical fixpoint theorem and its applications
- A Logarithmic Property for Exponents of Partially Ordered Sets
- An Effective Version of Dilworth's Theorem
- Certain partially ordered sets of dimension three
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Crowns, Fences, and Dismantlable Lattices
- Fixed-edge theorem for graphs with loops
- Graphs Orientable as Distributive Lattices
- scientific article; zbMATH DE number 3172312 (Why is no real title available?)
- scientific article; zbMATH DE number 3654187 (Why is no real title available?)
- scientific article; zbMATH DE number 3777562 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3482390 (Why is no real title available?)
- scientific article; zbMATH DE number 3482391 (Why is no real title available?)
- scientific article; zbMATH DE number 3529898 (Why is no real title available?)
- scientific article; zbMATH DE number 3437182 (Why is no real title available?)
- scientific article; zbMATH DE number 3299769 (Why is no real title available?)
- scientific article; zbMATH DE number 3375519 (Why is no real title available?)
- scientific article; zbMATH DE number 3411070 (Why is no real title available?)
- scientific article; zbMATH DE number 3411071 (Why is no real title available?)
- scientific article; zbMATH DE number 3063068 (Why is no real title available?)
- scientific article; zbMATH DE number 3094303 (Why is no real title available?)
- scientific article; zbMATH DE number 3103213 (Why is no real title available?)
- Lattices with Doubly Irreducible Elements
- Locally triangular graphs and normal quotients of the n-cube
- On the Construction of Partially Ordered Systems with a Given Group of Automorphisms
- Partially Ordered Sets
- Partially Ordered Sets
- Path length in the covering graph of a lattice
- Planar Lattices
- Retracts and the Fixed Point Problem for Finite Partially Ordered Sets
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Some Monotonicity Properties of Partial Orders
- Spanning retracts of a partially ordered set
- Subdirect representations in axiomatic classes
- The 3-Irreducible Partially Ordered Sets
- The FKG Inequality and Some Monotonicity Properties of Partial Orders
- The smallest order variety containing all chains
- The structure of Sperner k-families
- Undirected Graphs Realizable as Graphs of Modular Lattices
- Unoriented graphs of modular lattices
Cited in
(69)- An application of the Helly property to the partially ordered sets
- A note on axiomatizable order varieties
- Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
- Holes in ordered sets
- Fixed points of products and the strong fixed point property
- \(\kappa\)-embeddings of ordered sets
- Is there a diagram invariant?
- Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices
- The retracts of Hamming graphs
- Order varieties generated by finite posets
- Some complexity bounds for subtype inequalities
- Algorithms for the fixed point property
- Dismantlable graphs and posets, fixed clique property
- Cores and retracts
- Algebraic properties and dismantlability of finite posets
- Reducible classes of finite lattices
- Injective envelope of graphs and transition systems
- Injective envelope and parallel decomposition of a transition system
- Obituary: Ivan Rival
- The smallest graph variety containing all paths
- Monotone Jónsson operations and near unanimity functions
- From finite posets to chain complete posets having no infinite antichain
- The cylinder of a relation and generalized versions of the nerve theorem
- Powers of ordered sets
- On homotopy types of Alexandroff spaces
- A fixed point theorem for commuting families of relational homomorphisms. Applications to metric spaces, ordered sets and oriented graphs
- Generalized varieties
- Classes closed under isomorphisms, retractions, and products
- Retractions onto series-parallel posets
- Varieties of posets
- On the extension of vertex maps to graph homomorphisms
- Fixed point structures on a set-mapping pair and Cartesian product
- Retracts of abelian lattice ordered groups
- Lattice of retracts of monounary algebras
- Injective envelopes of transition systems and Ferrers languages
- All retraction operators on a complete lattice form a complete lattice
- Dr-irreducibility of connected monounary algebras with a cycle
- DR-irreducibility of connected monounary algebras
- Strong Retracts of Unary Algebras
- On a representation of monounary algebras
- Representation of Connected Monounary Algebras by Means of Irreducibles
- Monotone clones, residual smallness and congruence distributivity
- Retract varieties of lattice ordered groups
- scientific article; zbMATH DE number 63715 (Why is no real title available?)
- Retract varieties of monounary algebras
- Complete retract mappings of a complete lattice ordered group
- scientific article; zbMATH DE number 706776 (Why is no real title available?)
- scientific article; zbMATH DE number 1053104 (Why is no real title available?)
- Antiatomic retract varieties of monounary algebras
- Retract irreducibility of monounary algebras
- NU polymorphisms on reflexive digraphs
- Relative polars in ordered sets
- scientific article; zbMATH DE number 912432 (Why is no real title available?)
- Posets dismantlable by doubly irreducibles
- Partial order embeddings with convex range
- Sets with structure, mappings and fixed point property: fixed point structures
- Algebras, Graphs and Ordered Sets – ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet
- On retract varieties of algebras
- Some spaces that satisfy the Andrews-Curtis conjecture
- Counting of lattices on up to three reducible elements
- Order varieties generated by \(\vee\)-semilattices of finite width
- The strong selection property and ordered sets of finite length
- Every countable lattice is a retract of a direct product of chains
- Isotone relations and the fixed point property for posets
- Monotone clones and the varieties they determine
- Descending chains and antichains of the unary, linear, and monotone subfunction relations
- Algebraic properties of crowns and fences
- Diagrams, orientations, and varieties
- Absolute retracts and varieties generated by chordal graphs
This page was built for publication: A structure theory for ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151913)
