Enumerative Combinatorics and Postional Games
| dc.contributor.advisor | Whieldon, Gwyneth | |
| dc.contributor.author | Spessard, Clark | |
| dc.contributor.department | Hood College Mathematics | en_US |
| dc.contributor.program | Hood College Departmental Honors | en_US |
| dc.date.accessioned | 2023-05-09T18:14:06Z | |
| dc.date.available | 2023-05-09T18:14:06Z | |
| dc.date.issued | 2017-04 | |
| dc.description.abstract | Graph Avoidance games are a commonly studied type of combinatorial game. One class of graph avoidance games are Maker-Breaker games (Definition 3.4.1). In this thesis we prove weak solutions to Maker-Breaker games where Maker must construct a cycle, which we call Cycle Games (Definition 3.4.2), as well as provide methods to reduce the size of Cycle Game trees. | en_US |
| dc.format.extent | 47 pages | en_US |
| dc.genre | Departmental Honors Paper | en_US |
| dc.identifier | doi:10.13016/m2kmor-v1e3 | |
| dc.identifier.uri | http://hdl.handle.net/11603/27840 | |
| dc.language.iso | en_US | en_US |
| dc.title | Enumerative Combinatorics and Postional Games | en_US |
| dc.type | Text | en_US |