Prof. Su Doree
The Hanoi graphs are infinite family of state graphs arising from the generalized Tower of Hanoi puzzle.
In this talk I will introduce these beautiful and complicated graphs, explore some of the properties of these graphs (including a natural labeling and coloring), and mention how alternative counts in the graph can be used to prove some well-known combinatorial identities.
All I assume is a passing familiarity with graphs, elementary counting techniques, and recursions -- certainly any graduate student should find the talk accessible.
Go Back to Junior Coll. Web page
URL http://www.math.umn.edu/jrcoll/ The University of Minnesota is an equal opportunity educator and employer. © 2004, The Regents of the University of Minnesota |
|