Title: Hamiltonian Cycles and Their Uses Speaker: Voula Collins (University of Connecticut)
Time: Wednesday, February 22, 2017 at 5:45 pm Place: MONT 321Abstract: There are many different ways to think about traveling through a graph: minimizing how long it takes to get from vertex A to vertex B, the number of ways to get from A to B, whether you travel along every edge just once, whether you travel through every vertex just once, and many more. The last two types of paths in a graph are called Eulerian and Hamiltonian paths, respectively. We will see what is known about whether such paths in a graph exist, how to find them, and why we care about them, including a discussion of some useful and not-quite-so useful applications.Comments: Free pizza and drinks!