3 problems

Frieze–Krivelevich–Michaeli conjecture. If

Consider the online power-of-choices geometric graph process on $n$ vertices, with radius … Here $c>0$, $f$ is a function from $(0,\infty)$ to $(0,1)$, and w.h.p. means with high p…

Let $K_n$ be the complete graph on $n$ vertices, and let $\mathcal L(n,q)$ denote the largest component size that Waiter can force in Client's graph when playing a $(q:1)$ Waiter–C…