Quasivarieties of graphs (Q1920803)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Quasivarieties of graphs
scientific article

    Statements

    Quasivarieties of graphs (English)
    0 references
    0 references
    4 November 1996
    0 references
    By a graph we mean a model of a binary predicate \(\rho(x,y)\). Many well-known properties of binary relations, such as reflexivity, symmetry, antisymmetry, transitivity, etc., are written down by means of quasiidentities. Such important classes of graphs as the class of all partial orders, the class of models of an equivalence relation, the class of all trees, the class of all \(n\)-chromatic graphs, etc. are quasivarieties. Nevertheless, there are very few articles devoted to the study of graphs from the point of view of the theory of quasivarieties of algebraic systems. In the present article we continue the study, initiated by \textit{I. E. Benenson} [Izv. Vyssh. Uchebn. Zaved., Mat. 1979, No. 12(211), 14-20 (1979; Zbl 0432.08007)], of the lattices of quasivarieties and the bases of quasiidentities for some classes of graphs.
    0 references
    graph
    0 references
    model of a binary predicate
    0 references
    binary relations
    0 references
    partial orders
    0 references
    models of an equivalence relation
    0 references
    trees
    0 references
    \(n\)-chromatic graphs
    0 references
    lattices of quasivarieties
    0 references
    bases of quasiidentities
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references