'Copoint Graphs & Happy Endings' - A convex geometry is an object defined with a closure operator on a finite set that satisfies various properties. As the name would sugget, these objects wind up being a discretized abstraction of geometric convexity. In order to learn more about these convex geometries, we can form a graph from the copoints of this convex geometry. A graph that can be realized in this way from a convex geometry is called a copoint graph. In this talk, we will define more precisely what properties are required of a convex geometry, how to construct a copoint graph from a given convex geometry, and give an example of why these copoint graphs are useful. Then, time permitting, we will look at some recent results relating to copoint graphs and convex geometries.
Monday, October 28, 2019 at 4:40pm to 5:30pm
3203 Southeast Woodstock Boulevard, Portland, Oregon 97202-8199
Reed Community Members
If you are a member of the Reed community, you MUST LOG IN to see events that are open ONLY to the Reed community. Log in with your Reed ID (your Kerberos account information). If you don’t remember your account username or password, go to reed.edu/cis/help/kerberos.Log in with Reed ID