
The aim of the present paper is to study the fair Maker-Breaker graph Ramsey game. It is shown that the Maker has a winning strategy in the game if certain conditions are satisfied which is exacly the clique number of the random graph on \(n\) vertices with edge-probability 1/2. Due to an old theorem of Erdős and Selfridge this is best possible apart from an additive constant.
positional games, Ramsey games, Games involving graphs, Positional games (pursuit and evasion, etc.), random graphs
positional games, Ramsey games, Games involving graphs, Positional games (pursuit and evasion, etc.), random graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 22 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
