On the minimum order of graphs with given semigroup
From MaRDI portal
Publication:793058
DOI10.1016/0095-8956(84)90021-2zbMath0538.05054OpenAlexW2034331627MaRDI QIDQ793058
Publication date: 1984
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(84)90021-2
Hypergraphs (05C65) Graph theory (05C99) Representation of semigroups; actions of semigroups on sets (20M30)
Related Items (11)
Semigroup theory of symmetry ⋮ Graphs and ranks of monoids ⋮ Endomorphism breaking in graphs ⋮ On tension-continuous mappings ⋮ Tension continuous maps -- their structure and applications ⋮ On the number of graphs with a given endomorphism monoid ⋮ REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS ⋮ On graphs with a given endomorphism monoid ⋮ Almost all graphs are rigid-revisited ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Almost all graphs are rigid - Revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- Infinite digraphs with given regular automorphism groups
- Relations (graphs) with given finitely generated semigroups
- On the Minimum Order of Graphs with Given Group
- The Number of Semigroups of Order n
- Graphs and k-Societies
- Asymmetric graphs
- Some remarks on the theory of graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Subdirect unions in universal algebra
This page was built for publication: On the minimum order of graphs with given semigroup
