Strong games played on random graphs
In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). The winner is the first one to claim all the edges of some target structure (such as a clique K[subscript k], a perfect ma...
| Κύριοι συγγραφείς: | , |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Άρθρο |
| Γλώσσα: | en_US |
| Έκδοση: |
European Mathematical Information Service (EMIS)
2017
|
| Διαθέσιμο Online: | http://hdl.handle.net/1721.1/110013 |