Date of Submission
Project Advisor 1
We study a pursuit game involving one or more pursuers and an invisible target on finite, connected topological graphs. The winning condition for this game leads to a sequence of minor closed properties, and one of our main goals is to characterize the forbidden minors for these properties. We also study simple graphs, multigraphs and topological graphs in the context of this game, and explore the complicated relationship between the forbidden graph characterizations for each. We conclude with some results on how the minor closed properties we are studying are related to pathwidth, one of the main concepts underlying the proof of the Forbidden Minor Theorem. As part of our research, we created a computer program on Processing, an open source programming language, which enables us to interactively play the game on a computer. The code for this program is given in the concluding chapter of this project.
Access restricted to On-Campus only
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
Bhattacharyya, Abhinanda, "Forbidden Minors for a Pursuit Game on Graphs" (2013). Senior Projects Spring 2013. 408.
This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.Bard Off-campus Download
Bard College faculty, staff, and students can login from off-campus by clicking on the Off-campus Download button and entering their Bard username and password.