Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"Domination Game"”.
-
Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies
Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-07-10T16:04:32Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 thesis.pdf: 580482 bytes, checksum: 33853047e47046b466c6e010e8cbbd38 (MD5) Zamani Nasab_Reza.pdf: 580482 bytes, checksum: …
-
Topics in Probabilistic Combinatorics
… Chapter 5 to 7 delve into combinatorial games and query problems in graphs. In Chapter 5, we investigate the online Ramsey number of paths, showing that for every $k\ge 10$, the online Ramsey number for paths $P_k$ and $P_n$ satisfies $\tilde{r}(P_k,P_n) \geq \frac{5}{3}n + \frac{k}{9} - …
-
Games, Graphs, and Groups
… contains various combinatorial results about games, graphs and finite Abelian groups. A linear configuration is said to be *common* in an Abelian group $G$ if every 2-colouring of $G$ yields at least as many monochromatic instances of the configuration as a randomly chosen colouring. In …