Abstract
For a given finite monoid M we explicitly construct a finite group G and a relational morphism τ:M→G such that only elements of the type II construct Mc relate to 1 under τ. This provides an elementary and constructive proof of the type II conjecture of John Rhodes. The underlying idea is also used to modify the proof of Ash's celebrated theorem on inevitable graphs. For any finite monoid M and any finite graph Γ a finite group G is constructed which "spoils" all labelings of Γ over M which are not inevitable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
