[PAST EVENT] CSUMS Lecture/Mathematics Colloquium: Suil O (William & Mary)

November 18, 2011
2pm - 3pm
Jones Hall, Room 301
200 Ukrop Way
Williamsburg, VA 23185Map this location
Abstract: Matching theory is related to existence problems (conditions for a perfect matching), enumeration problems (how many perfect matchings) and optimization problems (fi nding a maximum-sized matching). A matching is a set of edges that pairwise share no vertices. The matching number of a graph $G$ is the maximum size of a matching in $G$. A graph $G$ is called regular if all vertices in V(G) have the same degree. In this talk, we will study the smallest matching number, and a relationship between eigenvalues and matching number in regular graphs.

This talk should be accessible to undergraduate students.