Quotients of rigid graphs

DOI10.1016/0095-8956(81)90052-6zbMath0473.05057OpenAlexW1983803013MaRDI QIDQ1158448

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

homomorphismquotientuniversal categoryrigid graph

Mathematics Subject Classification ID

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

Related Items (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

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric relations (undirected graphs) with given semigroups
• Every finite graph is a full subgraph of a rigid graph
• Any boundable binding category contains a proper class of mutually disjoint copies of itself
• Full embeddings into some categories of graphs
• On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
• The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
• Testing Categories and Strong Universality

This page was built for publication: Quotients of rigid graphs