View Proposal #511
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 511 |
|---|---|
| First Name | Lindsay |
| Last Name | Erickson |
| Institution | Augustana University |
| Speaker Category | faculty |
| Title of Talk | Edge-Nim on the $K_{2,n}$ |
| Abstract | Edge-Nim is a combinatorial game played on finite regular graphs with positive, integrally weighted edges. Two players alternately begin from an initialized vertex and move to an adjacent vertex, decreasing the weight of the incident edge to a strictly non-negative integer as they travel across it. The game ends when a player is confronted by a position where no incident edge has a nonzero weight (or, that is to say, when the player is unable to move), in which case, this player loses. We characterize the winner of edge-Nim on the complete bipartite graphs, $K_{2,n}$ for all positive integers, $n$, giving the solution and complete strategy for the player able to win. |
| Subject area(s) | Graph Theory, Game Theory |
| Suitable for undergraduates? | Y |
| Day Preference | FridayMild |
| Computer Needed? | Y |
| Bringing a laptop? | Y |
| Overhead Needed? | N |
| Software requests | |
| Special Needs | |
| Date Submitted | 09/21/2018 |
| Year | 2018 |