View Proposal #357
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 357 |
|---|---|
| First Name | Nathan |
| Last Name | Warnberg |
| Institution | Iowa State University |
| Speaker Category | graduate student |
| Title of Talk | Graph Forcing Games |
| Abstract | Let G be a graph with some vertex set initially colored blue and the rest of the vertices colored white. The goal of the game is to color the entire graph blue, based on some a set of rules. Depending on which set of rules are used the minimum number of initial blue vertices needed to force the entire graph blue has implications for the minimum rank of the graph's corresponding matrix family. We will demonstrate some of these games and show the connections with the minimum rank problem. |
| Subject area(s) | Combinatorial Matrix Theory |
| Suitable for undergraduates? | Y |
| Day Preference | none |
| Computer Needed? | N |
| Bringing a laptop? | Y |
| Overhead Needed? | N |
| Software requests | |
| Special Needs | |
| Date Submitted | 09/03/2013 |
| Year | 2013 |