Show simple item record

dc.contributor.advisorWilliford, Jason
dc.contributor.authorOursler, Roy
dc.contributor.authorOursler, Roy
dc.date2014-10-13
dc.date.accessioned2018-06-10T22:08:24Z
dc.date.available2018-06-10T22:08:24Z
dc.description.abstractIn mathematics, a graph is a set of vertices and a set of edges which connect pairs of vertices. A subgraph is graph that is a subset of vertices of a graph and a subset of the edges connecting those vertices. Some example graphs can be made drawing dots (vertices) on a piece of paper and drawing lines (edges) between those dots. Let F be a graph. The game F-Saturator is played by two players who take turns adding edges to a graph G. A player loses if after their move, F is a subgraph of G. For example, a triangle could be F, and if a player adds an edge which completes a triangle, that player loses. This game is a tool to increase understanding of F-saturated graphs. An F-saturated graph is a graph which does not contain some subgraph F, but the addition of any edge to that graph creates the subgraph F. In this presentation, I analyze some versions of F-Saturator to determine which player wins and discuss the challenges of determining the winner through brute force computation.
dc.identifierhttp://repository.uwyo.edu/ugrd/2013_UGRD/Presentations/78
dc.identifierhttp://repository.uwyo.edu/context/ugrd/article/1456/type/native/viewcontent
dc.identifier.urihttps://hdl.handle.net/20.500.11919/2334
dc.languageEnglish
dc.publisherUniversity of Wyoming. Libraries
dc.sourceUndergraduate Research Day
dc.titleStrategies in the Game F-Saturator
dc.typePresentation
thesis.degree.disciplineMathematics


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record