close this window
Complete the following form to e-mail a copy of this event to a friend.
Hello, The following event may be of interest to you: The Coloring Graph and Variations Thursday, October 18, 2012 A lecture byRuth HaasSmith CollegeA proper coloring is an assignment of a color to each vertex of a graph G so that neighboring vertices have different colors. Graph coloring has been a motivating topic for much of graph theory. Suppose we change the color of just one vertex in a graph coloring. Can we get from one coloring to another by a sequence of vertex changes so that each step along the way is a proper coloring? The answer is of course yes, if we are allowed an unlimited number of colors. What is the fewest colors we can have for this to work?We introduce a new graph called the coloring graph to analyze this situation. The coloring graph, and similar constructions, can be used to solve problems ranging from counting the possible number of graph colorings to modeling spin configurations in atoms. Location: RKC 111 Sponsor: Mathematics Program Contact: Lauren Rose. E-mail: [email protected] Phone: 845-758-7362 If you would like to see more events please visit the following URL: http://www.bard.edu/news/events/