Anita Liebenau

On the Concentration of the Domination Number of the Random Graph

In this paper we study the behavior of the domination number of the Erdos--Renyi random graph

Building spanning trees quickly in Maker-Breaker games

\mathcal{G}(n,p)

First order convergence of matroids

. Extending a result of Wieland and Godbole we show that the domination number of

On the minimum degree of minimal Ramsey graphs for multiple colours

\mathcal{G}(n,p)

The Random Graph Intuition for the Tournament Game

is equal to one of two values asymptotically almost surely whenever

A non-trivial upper bound on the threshold bias of the Oriented-cycle game

p \gg \frac{\ln^2n}{\sqrt{n}}

On the threshold bias in the oriented cycle game

. The explicit values are exactly at the first moment threshold, that is, where the expected number of dominating sets starts to tend to infinity. For small

Fast strategies in maker-breaker games played on random boards

p

What is Ramsey-equivalent to a clique?

we also provide various nonconcentration results which indicate why some sort of lower bound on the probability

Ramsey equivalence of

p