Colloquium and Seminar Schedule
This is the schedule of colloquia and seminars inthe Department of Mathematics and Computer Science for the Spring semester, 2017.
- "Classifying Well-Covered Graphs"
Speakers: Mark Curiel H'17 and Jacque Kane WS'18
Date: Thursday, February 23
Time: 4:45 PM
Location: Napier 201
Refreshments will be served at 4:30.
Last summer, we spent eight weeks researching Graph Theory as part of the Summer Science program on campus. A graph is a mathematical structure used to show relationships between objects, and they arise in many areas of study. These graphs are usually depicted with vertices and edges connecting them. In our research in Graph Theory, we focused on two main properties of graphs: independent sets and dominating sets. In general, it is difficult to determine the maximum and minimum size, respectively, of these sets for a general graph, G. However, for certain classes of graphs called well-covered graphs and well-dominated graphs, these parameters become easy to discover. We searched for ways to classify subclasses of well-covered graphs that shared properties such as connected, 4-regular, and claw-free. In this talk, we will introduce you to graphs and describe to you our journey discovering new theorems about them, as well as share our experiences participating in the Summer Science program.
Past Colloquia Series
If you have interest in giving a talk or know of someone who does,
please contact Professor Jocelyn Bell at email@example.com