Endomorphism classes of ordered sets, graphs and lattices

DOI10.1023/A:1006010725949MaRDI QIDQ1272942zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 5 July 1999

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1006010725949

zbMATH Keywords

bipartite graphsdistributive latticesendomorphism classesreflexive graphsreflexive partial ordersrigid structuresundirected graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Partial orders, general (06A06) Structure and representation theory of distributive lattices (06D05) Automorphisms and endomorphisms of algebraic structures (08A35)

Review text

Mathematical structures of a certain type with an underlying set \(X\) are considered; they form the class \(C\). If \(S\in C\), then \(\text{End} S\) is the set of endomorphisms of \(S\). The following question is considered: Which structures \(S'\in C\) on the set \(X\) have the property that \(\text{End} S\subseteq\text{End} S'\)? If for some \(S\in C\) all structures from \(C\) on \(X\) have this property, then \(S\) is called rigid. The question is answered for reflexive partial orders, reflexive undirected graphs, irreflexive bipartite undirected graphs and distributive lattices.

Recommendations

• Endomorphisms of quasiorders and related lattices
• scientific article; zbMATH DE number 783959
• Naturally ordered strong endomorphisms on graphs
• On certain semigroups of endomorphisms determining the order in a set

Cited in

(2)

• Semirigid sets of diamond orders
• On growth function of finite rigid lattices

This page was built for publication: Endomorphism classes of ordered sets, graphs and lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272942)