Counting completely 0-simple and completely simple semigroups

DOI10.1017/S0308210500019806MaRDI QIDQ3852396zbMATH OpenFDO

Authors C. H. Houghton

Publication date 1977

Published in Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0308210500019806

zbMATH Keywords

bicoloured graphscompletely simple semigroupscounting procedurefinite semigroupsnumber of completely O-simple semigroupsRees matric semigroup

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) General structure theory for semigroups (20M10) Representation of semigroups; actions of semigroups on sets (20M30)

Cites work

• Completely O-simple semigroups and their associated graphs and groups
• scientific article; zbMATH DE number 3552814 (Why is no real title available?)
• On the number of bi-colored graphs

Cited in

(1)

• Anti-isomorphisms of completely 0-simple semigroups

This page was built for publication: Counting completely 0-simple and completely simple semigroups

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