ZZ Warner 203
303 College Street
Middlebury, VT 05753
View in Campus Map

Open to the Public

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