Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


osu1275073614.pdf (404.4 KB)

ETD Abstract Container

Abstract Header

Graph Games

Mehta, Nishali
http://rave.ohiolink.edu/etdc/view?acc_num=osu1275073614

Abstract Details

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)
Mathematics

Recommended Citations

Citations

  • Mehta, N. (2010). Graph Games [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275073614

    APA Style (7th edition)

  • Mehta, Nishali. Graph Games. 2010. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1275073614.

    MLA Style (8th edition)

  • Mehta, Nishali. "Graph Games." Doctoral dissertation, Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275073614

    Chicago Manual of Style (17th edition)

osu1275073614
434
© 2010, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.