Quotients of rigid graphs

DOI10.1016/0095-8956(81)90052-6MaRDI QIDQ1158448zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1981

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(81)90052-6

zbMATH Keywords

quotienthomomorphismuniversal categoryrigid graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Embedding theorems, universal categories (18B15)

Cites work

• scientific article; zbMATH DE number 3632515 (Why is no real title available?)
• scientific article; zbMATH DE number 3240401 (Why is no real title available?)
• Any boundable binding category contains a proper class of mutually disjoint copies of itself
• Every finite graph is a full subgraph of a rigid graph
• Full embeddings into some categories of graphs
• On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
• Symmetric relations (undirected graphs) with given semigroups
• Testing Categories and Strong Universality
• The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra

Cited in

(4)

• Towards a characterization of universal categories
• Images of rigid digraphs
• A surprising permanence of old motivations (a not-so-rigid story)
• Homomorphisms of unary algebras with a given quotient

This page was built for publication: Quotients of rigid graphs

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