MATH Seminar

Title: On Graphs with a Given Endomorphism Monoid
Defense: Dissertation
Speaker: Benjamin Shemmer of Emory University
Contact: Benji Shemmer, bshemmer@emory.edu
Date: 2009-04-02 at 4:00PM
Venue: MSC W201
Download Flyer
Abstract:
Hedlin and Pultr proved that for any monoid M there exists a graph G with endomorphism monoid isomorphic to M. We will give a construction G(M) for a graph with prescribed endomorphism monoid M. Using this construction we derive bounds on the minimum number of vertices and edges required to produce a graph with a given endomorphism monoid for various classes of finite monoids.

See All Seminars