Impartial Intersection Restriction Games

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.

Creator: 

Huggan, Melissa Amber

Date: 

2015

Abstract: 

Intersection restriction games are games played on hypergraphs in which options for a player are restricted based on previous play via some intersection property. This paper focuses on two games within this class: Arc-Kayles and a Triple Packing game. Arc-Kayles is a game where, on their turn, players remove an edge and all adjacent edges from a graph. Together, players are forming a maximal matching. The Triple Packing game is a combinatorial design game where players are choosing triples such that no two triples chosen share a pair. Both games are played under normal play. We give new results for Arc-Kayles played on a special star graph and the wheel graph as well as partial results for the Triple Packing game played on the complete graph.

Subject: 

Mathematics

Language: 

English

Publisher: 

Carleton University

Thesis Degree Name: 

Master of Science: 
M.Sc.

Thesis Degree Level: 

Master's

Thesis Degree Discipline: 

Pure Mathematics

Parent Collection: 

Theses and Dissertations

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).