Bipartite graphs and completely 0-simple semigroups.

DOI10.1007/S00233-011-9367-XzbMath1257.20053OpenAlexW1994421285MaRDI QIDQ415549

Norman R. Reilly

Publication date: 8 May 2012

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-011-9367-x

zbMATH Keywords

completely 0-simple semigroupsbipartite graphsRees matrix semigroupsfree objectsRees-Sushkevich varieties

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Regular semigroups (20M17)

Related Items (6)

Rees semigroups of digraphs for classification of data. ⋮ Regular principal factors in free objects in Rees-Sushkevich varieties. ⋮ Classification systems based on combinatorial semigroups ⋮ Regular principal factors in free objects in varieties in the interval \([\mathbf{B_2},\mathbf{NB_2}\vee\mathbf{G_n}\).] ⋮ A combinatorial approach to the structure of locally inverse semigroups ⋮ Rees matrix seminearring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular principal factors in free objects in Rees-Sushkevich varieties.
• Some conditions related to the exactness of Rees-Sushkevich varieties.
• VARIETIES GENERATED BY COMPLETELY 0-SIMPLE SEMIGROUPS
• On finite 0-simple semigroups and graph theory

This page was built for publication: Bipartite graphs and completely 0-simple semigroups.