On the minimum order of graphs with given semigroup
From MaRDI portal
(Redirected from Publication:793058)
Recommendations
Cites work
- scientific article; zbMATH DE number 3650785 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Asymmetric graphs
- Graphs and k-Societies
- Infinite digraphs with given regular automorphism groups
- On Lovász' lattice reduction and the nearest lattice point problem
- On the Minimum Order of Graphs with Given Group
- Relations (graphs) with given finitely generated semigroups
- Some remarks on the theory of graphs
- Subdirect unions in universal algebra
- The Number of Semigroups of Order n
Cited in
(14)- Almost all graphs are rigid-revisited
- On the number of graphs with a given endomorphism monoid
- Endomorphism breaking in graphs
- The order of monochromatic subgraphs with a given minimum degree
- Tension continuous maps -- their structure and applications
- Minimal Representations of Order Types by Geometric Graphs
- On graphs with a given endomorphism monoid
- Graphs and ranks of monoids
- Almost all graphs are rigid - Revisited
- Semigroup theory of symmetry
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs
- On tension-continuous mappings
- A surprising permanence of old motivations (a not-so-rigid story)
- REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
This page was built for publication: On the minimum order of graphs with given semigroup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793058)