Search ETDs:
Graph Games
Mehta, Nishali

2010, Doctor of Philosophy, Ohio State University, Mathematics.
We consider variants of the triangle-avoidance game first defined by Harary and rediscovered by Hajnal a few years later. A graph game consists of two players beginning with an empty graph on n vertices. The two players take turns choosing edges within Kn, building up a simple graph. The edges must be chosen according to a set of restrictions R. The winner is the last player to choose an edge that does not violate any of the restrictions in R. For fixed n and R, one of the players has a winning strategy. We look at games where R includes bounded degree, triangle-avoidance, and/or connectedness, and determine the winner for all n.
Akos Seress (Advisor)
Neil Robertson (Committee Member)
Boris Pittel (Committee Member)

Recommended Citations

Hide/Show APA Citation

Mehta, N. (2010). Graph Games. (Electronic Thesis or Dissertation). Retrieved from https://etd.ohiolink.edu/

Hide/Show MLA Citation

Mehta, Nishali. "Graph Games." Electronic Thesis or Dissertation. Ohio State University, 2010. OhioLINK Electronic Theses and Dissertations Center. 26 Sep 2017.

Hide/Show Chicago Citation

Mehta, Nishali "Graph Games." Electronic Thesis or Dissertation. Ohio State University, 2010. https://etd.ohiolink.edu/

Files

osu1275073614.pdf (404.4 KB) View|Download