Full embeddings into some categories of graphs

DOI10.1007/BF02945020zbMath0257.05115MaRDI QIDQ2559488

Pavol Hell

Publication date: 1972

Published in: Algebra Universalis (Search for Journal in Brave)

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Structure theory of algebraic structures (08A05) Embedding theorems, universal categories (18B15)

Related Items (9)

Group-universal unary varieties ⋮ Quotients of rigid graphs ⋮ Nonconstant Endomorphisms of Lattices ⋮ On some strongly rigid families of graphs and the full embeddings they induce ⋮ Homomorphisms of graphs and of their orientations ⋮ Homomorphisms of bounded lattices with a given sublattice ⋮ A note on finitely generated hopfian lattices ⋮ Chromatic automorphisms of graphs ⋮ Free products of hopfian lattices

Cites Work

• Unnamed Item
• On full embeddings of categories of algebras
• Symmetric relations (undirected graphs) with given semigroups
• How comprehensive is the category of semigroups?
• Every finite graph is a full subgraph of a rigid graph
• 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
• Graphs and k-Societies
• Nonconstant Endomorphisms of Lattices
• Testing Categories and Strong Universality

This page was built for publication: Full embeddings into some categories of graphs