Kelsey Hoekstra Mathematics Senior Thesis Talk
![](/events/sites/default/files/styles/large/public/event_photos/cayleydigraph.jpg?itok=uVAohhw1)
Kelsey will discuss Cayley Digraphs. Could you pass through every vertex in this graph exactly once? Could you then return to the starting point? Cayley digraphs are a fun way to visualize groups, and Hamiltonian paths and circuits are ways to navigate these digraphs. In this talk I will examine some Cayley digraphs and a few proofs on the existence on Hamiltonian paths and circuits.
- Sponsored by:
- Mathematics
Contact Organizer
Olinick, Mike
molinick@middlebury.edu
802.443.5559